MJay

[Greedy] - 1196 본문

Programming/LeetCode

[Greedy] - 1196

MJSon 2019. 10. 8. 07:49

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

 

 

'Programming > LeetCode' 카테고리의 다른 글

[DP] - 121. Best Time to Buy and Sell Stock  (0) 2019.10.16
[DP] - 53. Maximum Subarray  (2) 2019.10.10
[Tree] - 617  (0) 2019.10.09
[Tree] [Recursion] - 938  (0) 2019.10.08
[Array] - 1085  (0) 2019.10.05