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;
        }
    }
}

@@ -59,671 +59,8 @@
 s;%0A%0A
-/**%0A * 1196. How Many Apples Can You Put into the Basket%0A *%0A * You have some apples, where arr%5Bi%5D is the weight of the i-th apple.  You also have a basket that can carry up to 5000 units of weight.%0A * Return the maximum number of apples you can put in the basket.%0A *%0A * Example 1:%0A * Input: arr = %5B100,200,150,1000%5D%0A * Output: 4%0A * Explanation: All 4 apples can be carried by the basket since their sum of weights is 1450.%0A *%0A * Example 2:%0A * Input: arr = %5B900,950,800,1000,700,800%5D%0A * Output: 5%0A * Explanation: The sum of weights of the 6 apples exceeds 5000 so we choose any 5 of them.%0A *%0A * Constraints:%0A * 1 %3C= arr.length %3C= 10%5E3%0A * 1 %3C= arr%5Bi%5D %3C= 10%5E3%0A * */%0A
 publ

refactor 1196