File tree 4 files changed +8
-4
lines changed
s3477_fruits_into_baskets_ii
s3478_choose_k_elements_with_maximum_sum
s3479_fruits_into_baskets_iii
s3480_maximize_subarrays_after_removing_one_conflicting_pair
4 files changed +8
-4
lines changed Original file line number Diff line number Diff line change 1
1
package g3401_3500 .s3477_fruits_into_baskets_ii ;
2
2
3
- // #Easy #2025_03_09_Time_2_ms_(100.00%)_Space_45.04_MB_(100.00%)
3
+ // #Easy #Array #Binary_Search #Simulation #Segment_Tree
4
+ // #2025_03_10_Time_2_ms_(100.00%)_Space_43.96_MB_(100.00%)
4
5
5
6
public class Solution {
6
7
public int numOfUnplacedFruits (int [] fruits , int [] baskets ) {
Original file line number Diff line number Diff line change 1
1
package g3401_3500 .s3478_choose_k_elements_with_maximum_sum ;
2
2
3
- // #Medium #2025_03_09_Time_156_ms_(100.00%)_Space_63.92_MB_(100.00%)
3
+ // #Medium #Array #Sorting #Heap_(Priority_Queue)
4
+ // #2025_03_10_Time_157_ms_(100.00%)_Space_62.83_MB_(50.00%)
4
5
5
6
import java .util .Arrays ;
6
7
import java .util .PriorityQueue ;
Original file line number Diff line number Diff line change 1
1
package g3401_3500 .s3479_fruits_into_baskets_iii ;
2
2
3
- // #Medium #2025_03_09_Time_629_ms_(100.00%)_Space_67.19_MB_(100.00%)
3
+ // #Medium #Array #Binary_Search #Ordered_Set #Segment_Tree
4
+ // #2025_03_10_Time_655_ms_(100.00%)_Space_65.58_MB_(50.00%)
4
5
5
6
import java .util .ArrayList ;
6
7
import java .util .List ;
Original file line number Diff line number Diff line change 1
1
package g3401_3500 .s3480_maximize_subarrays_after_removing_one_conflicting_pair ;
2
2
3
- // #Hard #2025_03_09_Time_581_ms_(_%)_Space_163.11_MB_(_%)
3
+ // #Hard #Array #Prefix_Sum #Enumeration #Segment_Tree
4
+ // #2025_03_10_Time_567_ms_(100.00%)_Space_159.65_MB_(50.00%)
4
5
5
6
import java .util .ArrayList ;
6
7
import java .util .Arrays ;
You can’t perform that action at this time.
0 commit comments