add 1260

Author: luliyucoordinate

README.md

@@ -564,4 +564,5 @@ LeetCode
 |1256|[Encode Number](https://leetcode.com/contest/biweekly-contest-13/problems/encode-number/)|c|[c++](./src/1256-Encode-Number/1256.cpp)|[python](./src/1256-Encode-Number/1256.py)|[go](./src/1256-Encode-Number/1256.go)|[js](./src/1256-Encode-Number/1256.js)|[java](./src/1256-Encode-Number/1256.java)|Medium|
 |1257|[Smallest Common Region](https://leetcode.com/contest/biweekly-contest-13/problems/smallest-common-region/)|c|[c++](./src/1257-Smallest-Common-Region/1257.cpp)|[python](./src/1257-Smallest-Common-Region/1257.py)|[go](./src/1257-Smallest-Common-Region/1257.go)|[js](./src/1257-Smallest-Common-Region/1257.js)|[java](./src/1257-Smallest-Common-Region/1257.java)|Medium|
 |1258|[Synonymous Sentences](https://leetcode.com/contest/biweekly-contest-13/problems/synonymous-sentences/)|c|[c++](./src/1258-Synonymous-Sentences/1258.cpp)|[python](./src/1258-Synonymous-Sentences/1258.py)|[go](./src/1258-Synonymous-Sentences/1258.go)|[js](./src/1258-Synonymous-Sentences/1258.js)|[java](./src/1258-Synonymous-Sentences/1258.java)|Medium|
-|1259|[Handshakes That Don't Cross](https://leetcode.com/contest/biweekly-contest-13/problems/handshakes-that-dont-cross/)|c|[c++](./src/1259-Handshakes-That-Don't-Cross/1259.cpp)|[python](./src/1259-Handshakes-That-Don't-Cross/1259.py)|[go](./src/1259-Handshakes-That-Don't-Cross/1259.go)||[java](./src/1259-Handshakes-That-Don't-Cross/1259.java)|Hard|
+|1259|[Handshakes That Don't Cross](https://leetcode.com/contest/biweekly-contest-13/problems/handshakes-that-dont-cross/)|c|[c++](./src/1259-Handshakes-That-Don't-Cross/1259.cpp)|[python](./src/1259-Handshakes-That-Don't-Cross/1259.py)|[go](./src/1259-Handshakes-That-Don't-Cross/1259.go)||[java](./src/1259-Handshakes-That-Don't-Cross/1259.java)|Hard|
+|1260|[Shift 2D Grid](https://leetcode.com/problems/shift-2d-grid/)|c|[c++](./src/1260-Shift-2D-Grid/1260.cpp)|[python](./src/1260-Shift-2D-Grid/1260.py)|[go](./src/1260-Shift-2D-Grid/1260.go)|[js](./src/1260-Shift-2D-Grid/1260.js)|[java](./src/1260-Shift-2D-Grid/1260.java)|Easy|

src/1260-Shift-2D-Grid/1260.cpp

@@ -0,0 +1,18 @@
+class Solution 
+{
+public:
+    vector<vector<int>> shiftGrid(vector<vector<int>>& grid, int k) 
+    {
+        int n = grid.size(), m = grid[0].size();
+        vector<vector<int>> res(n, vector<int>(m, 0));
+        for (int i = 0; i < n; i++) 
+        {
+            for (int j = 0; j < m; j++)
+            {
+                int t = j + k;
+                res[(i + t / m)%n][t % m] = grid[i][j];
+            }
+        }
+        return res;
+    }
+};

src/1260-Shift-2D-Grid/1260.go

@@ -0,0 +1,15 @@
+func shiftGrid(grid [][]int, k int) [][]int {
+    n, m := len(grid), len(grid[0])
+    res := make([][]int, n)
+    for i := 0; i < n; i++ {
+        res[i] = make([]int, m)
+    }
+    
+    for i := 0; i < n; i++ {
+        for j := 0; j < m; j++ {
+            t := j + k
+            res[(i + t / m)%n][t % m] = grid[i][j]
+        }
+    }
+    return res
+}

src/1260-Shift-2D-Grid/1260.java

@@ -0,0 +1,18 @@
+class Solution {
+    public List<List<Integer>> shiftGrid(int[][] grid, int k) {
+        int n = grid.length, m = grid[0].length;
+        Integer[][] ret = new Integer[n][m];
+        
+        for (int i = 0; i < n; i++) {
+            for (int j = 0; j < m; j++) {
+                int t = j + k;
+                ret[(i + t / m)%n][t % m] = grid[i][j];
+            }
+        }
+        List<List<Integer>> res = new ArrayList();
+        for (int i = 0; i < n; i++) {
+            res.add(Arrays.asList(ret[i]));
+        }
+        return res;
+    }
+}

src/1260-Shift-2D-Grid/1260.js

@@ -0,0 +1,14 @@
+var shiftGrid = function(grid, k) {
+    let n = grid.length, m = grid[0].length;
+    let res = new Array(n);
+    for (let i = 0; i < n; i++) {
+        res[i] = new Array(m);
+    }
+    for (let i = 0; i < n; i++) {
+        for (let j = 0; j < m; j++) {
+            let t = j + k;
+            res[(i + Math.floor(t/m))%n][t % m] = grid[i][j];
+        }
+    }
+    return res;
+};

src/1260-Shift-2D-Grid/1260.py

@@ -0,0 +1,9 @@
+class Solution:
+    def shiftGrid(self, grid: List[List[int]], k: int) -> List[List[int]]:
+        n, m = len(grid), len(grid[0])
+        res = [[0] * m for _ in range(n)]
+        for i in range(n):
+            for j in range(m):
+                t = j + k
+                res[(i + t//m)%n][t % m] = grid[i][j]
+        return res

src/addProb.py

@@ -2,10 +2,10 @@
 import os, bisect
 
 # 题目名称
-name = "Synonymous Sentences"
-ID = 1258
-url = "https://leetcode.com/contest/biweekly-contest-13/problems/synonymous-sentences/"
-difficult = "Medium"
+name = "Shift 2D Grid"
+ID = 1260
+url = "https://leetcode.com/problems/shift-2d-grid/"
+difficult = "Easy"
 prog = ['c', 'cpp', 'py', 'go', 'js', 'java']