add skeleton for 1049

fishercoder1534 · fishercoder1534 · commit 37c7fbf64365 · 2019-12-23T20:29:21.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_1049.java b/src/main/java/com/fishercoder/solutions/_1049.java
@@ -0,0 +1,34 @@
+package com.fishercoder.solutions;
+
+/**
+ * 1049. Last Stone Weight II
+ *
+ * We have a collection of rocks, each rock has a positive integer weight.
+ * Each turn, we choose any two rocks and smash them together.
+ * Suppose the stones have weights x and y with x <= y.  The result of this smash is:
+ * If x == y, both stones are totally destroyed;
+ * If x != y, the stone of weight x is totally destroyed, and the stone of weight y has new weight y-x.
+ * At the end, there is at most 1 stone left.  Return the smallest possible weight of this stone (the weight is 0 if there are no stones left.)
+ *
+ * Example 1:
+ * Input: [2,7,4,1,8,1]
+ * Output: 1
+ *
+ * Explanation:
+ * We can combine 2 and 4 to get 2 so the array converts to [2,7,1,8,1] then,
+ * we can combine 7 and 8 to get 1 so the array converts to [2,1,1,1] then,
+ * we can combine 2 and 1 to get 1 so the array converts to [1,1,1] then,
+ * we can combine 1 and 1 to get 0 so the array converts to [1] then that's the optimal value.
+ *
+ * Note:
+ * 1 <= stones.length <= 30
+ * 1 <= stones[i] <= 100
+ * */
+public class _1049 {
+    public static class Solution1 {
+        public int lastStoneWeightII(int[] stones) {
+            //TODO: implement it
+            return 1;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1049Test.java b/src/test/java/com/fishercoder/_1049Test.java
@@ -0,0 +1,25 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1049;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1049Test {
+    private static _1049.Solution1 solution1;
+    private static int[] stones;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1049.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        stones = new int[]{2, 7, 4, 1, 8, 1};
+        assertEquals(1, solution1.lastStoneWeightII(stones));
+    }
+
+
+}
