refactor 1260

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_1260.java

@@ -41,16 +41,17 @@ public static class Solution1 {
         public List<List<Integer>> shiftGrid(int[][] grid, int k) {
             int m = grid.length;
             int n = grid[0].length;
-            int start = m * n - k % (m * n);
+            int totalNumbers = m * n;
+            int start = totalNumbers - k % totalNumbers;
             LinkedList<List<Integer>> result = new LinkedList<>();
-            for (int i = start; i < m * n + start; i++) {
-                int newIndex = i % (m * n);
-                int newRow = newIndex / n;
-                int newColumn = newIndex % n;
+            for (int i = start; i < totalNumbers + start; i++) {
+                int moveIndex = i % totalNumbers;
+                int moveRow = moveIndex / n;
+                int moveColumn = moveIndex % n;
                 if ((i - start) % n == 0) {
                     result.add(new ArrayList<>());
                 }
-                result.peekLast().add(grid[newRow][newColumn]);
+                result.peekLast().add(grid[moveRow][moveColumn]);
             }
             return result;
         }