题解 | 向左移动牛群II

import java.util.*;


public class Solution {
    // 1 2 3 | 5 6 4
    // 4 5 6 | 8 9 7
    // 7 8 9 | 2 3 1
    public int[][] rotateII (int n, int k) {
        k = k % n;
        int ans[][] = new int[n][n];
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < n; ++j) {
                final int ii = (i + k) % n;
                final int jj = (j + k) % n;
                ans[i][j] = n * ii + jj + 1;
            }
        }
        return ans;
    }
}