add 1217

fishercoder1534 · fishercoder1534 · commit b3111c8d04b2 · 2020-02-02T13:21:43.000-08:00
diff --git a/README.md b/README.md
@@ -41,7 +41,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1232|[Check If It Is a Straight Line](https://leetcode.com/problems/check-if-it-is-a-straight-line/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1232.java) | [:tv:](https://www.youtube.com/watch?v=_tfiTQNZCbs)  |Easy||
 |1228|[Missing Number In Arithmetic Progression](https://leetcode.com/problems/missing-number-in-arithmetic-progression/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1228.java) |   |Easy||
 |1221|[Split a String in Balanced Strings](https://leetcode.com/problems/split-a-string-in-balanced-strings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1221.java) | |Easy|Greedy|
-|1217|[Play with Chips](https://leetcode.com/problems/play-with-chips/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1217.java) |   |Easy||
+|1217|[Play with Chips](https://leetcode.com/problems/play-with-chips/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1217.java) |   |Easy|Array, Math, Greedy|
 |1213|[Intersection of Three Sorted Arrays](https://leetcode.com/problems/intersection-of-three-sorted-arrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1213.java) |   [:tv:](https://www.youtube.com/watch?v=zceoOrHSHNQ)|Easy||
 |1207|[Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1207.java) | [: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||
diff --git a/src/main/java/com/fishercoder/solutions/_1217.java b/src/main/java/com/fishercoder/solutions/_1217.java
@@ -29,9 +29,18 @@
  * */
 public class _1217 {
     public static class Solution1 {
+        /**credit: https://leetcode.com/problems/play-with-chips/discuss/398239/C%2B%2B-3-lines*/
         public int minCostToMoveChips(int[] chips) {
-            //TODO: implement it
-            return -1;
+            int chipsAtOddPosition = 0;
+            int chipsAtEvenPosition = 0;
+            for (int i = 0; i < chips.length; i++) {
+                if (chips[i] % 2 == 0) {
+                    chipsAtEvenPosition++;
+                } else {
+                    chipsAtOddPosition++;
+                }
+            }
+            return chipsAtEvenPosition > chipsAtOddPosition ? chipsAtOddPosition : chipsAtEvenPosition;
         }
     }
 }
diff --git a/src/test/java/com/fishercoder/_1217Test.java b/src/test/java/com/fishercoder/_1217Test.java
@@ -0,0 +1,27 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1217;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1217Test {
+    private static _1217.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1217.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(1, solution1.minCostToMoveChips(new int[]{1, 2, 3}));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(2, solution1.minCostToMoveChips(new int[]{2, 2, 2, 3, 3}));
+    }
+
+}
