refactor 1217

fishercoder1534 · fishercoder1534 · commit c25b0fb5ad8e · 2020-11-05T06:33:12.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_1217.java b/src/main/java/com/fishercoder/solutions/_1217.java
@@ -5,11 +5,11 @@ public static class Solution1 {
         /**
          * credit: https://leetcode.com/problems/play-with-chips/discuss/398239/C%2B%2B-3-lines
          */
-        public int minCostToMoveChips(int[] chips) {
+        public int minCostToMoveChips(int[] position) {
             int chipsAtOddPosition = 0;
             int chipsAtEvenPosition = 0;
-            for (int i = 0; i < chips.length; i++) {
-                if (chips[i] % 2 == 0) {
+            for (int i = 0; i < position.length; i++) {
+                if (position[i] % 2 == 0) {
                     chipsAtEvenPosition++;
                 } else {
                     chipsAtOddPosition++;
