package com.fishercoder.solutions;

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;

/**
 * 1260. Shift 2D Grid
 *
 * Given a 2D grid of size m x n and an integer k. You need to shift the grid k times.
 *
 * In one shift operation:
 * Element at grid[i][j] becomes at grid[i][j + 1].
 * Element at grid[i][n - 1] becomes at grid[i + 1][0].
 * Element at grid[n - 1][n - 1] becomes at grid[0][0].
 * Return the 2D grid after applying shift operation k times.
 *
 * Example 1:
 * Input: grid = [[1,2,3],[4,5,6],[7,8,9]], k = 1
 * Output: [[9,1,2],[3,4,5],[6,7,8]]
 *
 * Example 2:
 * Input: grid = [[3,8,1,9],[19,7,2,5],[4,6,11,10],[12,0,21,13]], k = 4
 * Output: [[12,0,21,13],[3,8,1,9],[19,7,2,5],[4,6,11,10]]
 *
 * Example 3:
 * Input: grid = [[1,2,3],[4,5,6],[7,8,9]], k = 9
 * Output: [[1,2,3],[4,5,6],[7,8,9]]
 *
 * Constraints:
 * m == grid.length
 * n == grid[i].length
 * 1 <= m <= 50
 * 1 <= n <= 50
 * -1000 <= grid[i][j] <= 1000
 * 0 <= k <= 100
 * */
public class _1260 {
    public static class Solution1 {
        /**credit: https://leetcode.com/problems/shift-2d-grid/discuss/431102/JavaPython-3-simple-code-using-mod*/
        public List<List<Integer>> shiftGrid(int[][] grid, int k) {
            int m = grid.length;
            int n = grid[0].length;
            int totalNumbers = m * n;
            int start = totalNumbers - k % totalNumbers;
            LinkedList<List<Integer>> result = new LinkedList<>();
            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[moveRow][moveColumn]);
            }
            return result;
        }
    }
}

@@ -114,885 +114,8 @@
 t;%0A%0A
-/**%0A * 1260. Shift 2D Grid%0A *%0A * Given a 2D grid of size m x n and an integer k. You need to shift the grid k times.%0A *%0A * In one shift operation:%0A * Element at grid%5Bi%5D%5Bj%5D becomes at grid%5Bi%5D%5Bj + 1%5D.%0A * Element at grid%5Bi%5D%5Bn - 1%5D becomes at grid%5Bi + 1%5D%5B0%5D.%0A * Element at grid%5Bn - 1%5D%5Bn - 1%5D becomes at grid%5B0%5D%5B0%5D.%0A * Return the 2D grid after applying shift operation k times.%0A *%0A * Example 1:%0A * Input: grid = %5B%5B1,2,3%5D,%5B4,5,6%5D,%5B7,8,9%5D%5D, k = 1%0A * Output: %5B%5B9,1,2%5D,%5B3,4,5%5D,%5B6,7,8%5D%5D%0A *%0A * Example 2:%0A * Input: grid = %5B%5B3,8,1,9%5D,%5B19,7,2,5%5D,%5B4,6,11,10%5D,%5B12,0,21,13%5D%5D, k = 4%0A * Output: %5B%5B12,0,21,13%5D,%5B3,8,1,9%5D,%5B19,7,2,5%5D,%5B4,6,11,10%5D%5D%0A *%0A * Example 3:%0A * Input: grid = %5B%5B1,2,3%5D,%5B4,5,6%5D,%5B7,8,9%5D%5D, k = 9%0A * Output: %5B%5B1,2,3%5D,%5B4,5,6%5D,%5B7,8,9%5D%5D%0A *%0A * Constraints:%0A * m == grid.length%0A * n == grid%5Bi%5D.length%0A * 1 %3C= m %3C= 50%0A * 1 %3C= n %3C= 50%0A * -1000 %3C= grid%5Bi%5D%5Bj%5D %3C= 1000%0A * 0 %3C= k %3C= 100%0A * */%0A
 publ
@@ -178,16 +178,28 @@
      /**
+%0A         * 
 credit: 
@@ -291,16 +291,26 @@
 sing-mod
+%0A         
 */%0A     

refactor 1260