add skeleton for 1217

fishercoder1534 · fishercoder1534 · commit bd16189f6922 · 2019-11-24T07:07:49.000-08:00
diff --git a/README.md b/README.md
@@ -29,6 +29,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |-----|----------------|---------------|---------------|---------------|--------|-------------|-------------
 |1252|[Cells with Odd Values in a Matrix](https://leetcode.com/problems/cells-with-odd-values-in-a-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1252.java) | O(m*n + k) | O(m*n) | |Easy||
 |1237|[Find Positive Integer Solution for a Given Equation](https://leetcode.com/problems/find-positive-integer-solution-for-a-given-equation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1237.java) | | | |Easy||
+|1217|[Play with Chips](https://leetcode.com/problems/play-with-chips/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1217.java) |  |  | |Easy||
 |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) | |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||
 |1185|[Day of the Week](https://leetcode.com/problems/day-of-the-week/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1185.java) | | | |Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_1217.java b/src/main/java/com/fishercoder/solutions/_1217.java
@@ -0,0 +1,37 @@
+package com.fishercoder.solutions;
+
+/**
+ * 1217. Play with Chips
+ *
+ * There are some chips, and the i-th chip is at position chips[i].
+ * You can perform any of the two following types of moves any number of times (possibly zero) on any chip:
+ *
+ * Move the i-th chip by 2 units to the left or to the right with a cost of 0.
+ * Move the i-th chip by 1 unit to the left or to the right with a cost of 1.
+ *
+ * There can be two or more chips at the same position initially.
+ *
+ * Return the minimum cost needed to move all the chips to the same position (any position).
+ *
+ * Example 1:
+ * Input: chips = [1,2,3]
+ * Output: 1
+ * Explanation: Second chip will be moved to positon 3 with cost 1. First chip will be moved to position 3 with cost 0. Total cost is 1.
+ *
+ * Example 2:
+ * Input: chips = [2,2,2,3,3]
+ * Output: 2
+ * Explanation: Both fourth and fifth chip will be moved to position two with cost 1. Total minimum cost will be 2.
+ *
+ * Constraints:
+ * 1 <= chips.length <= 100
+ * 1 <= chips[i] <= 10^9
+ * */
+public class _1217 {
+    public static class Solution1 {
+        public int minCostToMoveChips(int[] chips) {
+            //TODO: implement it
+            return -1;
+        }
+    }
+}
