add 1196

fishercoder1534 · fishercoder1534 · commit 4ed75533ca34 · 2019-12-12T06:05:04.000-08:00
diff --git a/README.md b/README.md
@@ -23,6 +23,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1207|[Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1207.java) | O(n) | O(1) | [:tv:](https://www.youtube.com/watch?v=_NYimlZY1PE)|Easy||
 |1200|[Minimum Absolute Difference](https://leetcode.com/problems/minimum-absolute-difference/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1200.java) | || [:tv:](https://www.youtube.com/watch?v=mH1aEjOEjcQ)|Easy||
 |1198|[Find Smallest Common Element in All Rows](https://leetcode.com/problems/find-smallest-common-element-in-all-rows/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1198.java) | | | [:tv:](https://www.youtube.com/watch?v=RMiofZrTmWo)|Easy||
+|1196|[How Many Apples Can You Put into the Basket](https://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1196.java) | | | |Easy||
 |1189|[Maximum Number of Balloons](https://leetcode.com/problems/maximum-number-of-balloons/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1189.java) | | | |Easy||
 |1185|[Day of the Week](https://leetcode.com/problems/day-of-the-week/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1185.java) | | | |Easy||
 |1184|[Distance Between Bus Stops](https://leetcode.com/problems/distance-between-bus-stops/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1184.java) | | | [:tv:](https://www.youtube.com/watch?v=RFq7yA5iyhI)|Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_1196.java b/src/main/java/com/fishercoder/solutions/_1196.java
@@ -0,0 +1,41 @@
+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++) {
+                if (sum + arr[i] < 5000) {
+                    sum += arr[i];
+                } else {
+                    break;
+                }
+            }
+            return i;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1196Test.java b/src/test/java/com/fishercoder/_1196Test.java
@@ -0,0 +1,27 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1196;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1196Test {
+    private static _1196.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1196.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(4, solution1.maxNumberOfApples(new int[]{100, 200, 150, 1000}));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(5, solution1.maxNumberOfApples(new int[]{900, 950, 800, 1000, 700, 800}));
+    }
+
+}
