forked from fishercoder1534/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path_1196.java
40 lines (38 loc) · 1.09 KB
/
_1196.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
package com.fishercoder.solutions;
import java.util.Arrays;
/**
* 1196. How Many Apples Can You Put into the Basket
*
* You have some apples, where arr[i] is the weight of the i-th apple. You also have a basket that can carry up to 5000 units of weight.
* Return the maximum number of apples you can put in the basket.
*
* Example 1:
* Input: arr = [100,200,150,1000]
* Output: 4
* Explanation: All 4 apples can be carried by the basket since their sum of weights is 1450.
*
* Example 2:
* Input: arr = [900,950,800,1000,700,800]
* Output: 5
* Explanation: The sum of weights of the 6 apples exceeds 5000 so we choose any 5 of them.
*
* Constraints:
* 1 <= arr.length <= 10^3
* 1 <= arr[i] <= 10^3
* */
public class _1196 {
public static class Solution1 {
public int maxNumberOfApples(int[] arr) {
Arrays.sort(arr);
int sum = 0;
int i = 0;
for (; i < arr.length; i++) {
sum += arr[i];
if (sum > 5000) {
break;
}
}
return i;
}
}
}