1260:二维网格迁移
This commit is contained in:
轩辕龙儿
parent
b4ecd59ea9
commit
98b250dda9
98
src/main/java/leetcode/editor/cn/Shift2dGrid.java
Normal file
98
src/main/java/leetcode/editor/cn/Shift2dGrid.java
Normal file
@ -0,0 +1,98 @@
|
||||
//<p>给你一个 <code>m</code> 行 <code>n</code> 列的二维网格 <code>grid</code> 和一个整数 <code>k</code>。你需要将 <code>grid</code> 迁移 <code>k</code> 次。</p>
|
||||
//
|
||||
//<p>每次「迁移」操作将会引发下述活动：</p>
|
||||
//
|
||||
//<ul>
|
||||
// <li>位于 <code>grid[i][j]</code> 的元素将会移动到 <code>grid[i][j + 1]</code>。</li>
|
||||
// <li>位于 <code>grid[i][n - 1]</code> 的元素将会移动到 <code>grid[i + 1][0]</code>。</li>
|
||||
// <li>位于 <code>grid[m - 1][n - 1]</code> 的元素将会移动到 <code>grid[0][0]</code>。</li>
|
||||
//</ul>
|
||||
//
|
||||
//<p>请你返回 <code>k</code> 次迁移操作后最终得到的 <strong>二维网格</strong>。</p>
|
||||
//
|
||||
//<p> </p>
|
||||
//
|
||||
//<p><strong>示例 1：</strong></p>
|
||||
//
|
||||
//<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/11/16/e1-1.png" style="height: 158px; width: 400px;" /></p>
|
||||
//
|
||||
//<pre>
|
||||
//<code><strong>输入：</strong>grid</code> = [[1,2,3],[4,5,6],[7,8,9]], k = 1
|
||||
//<strong>输出：</strong>[[9,1,2],[3,4,5],[6,7,8]]
|
||||
//</pre>
|
||||
//
|
||||
//<p><strong>示例 2：</strong></p>
|
||||
//
|
||||
//<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/11/16/e2-1.png" style="height: 166px; width: 400px;" /></p>
|
||||
//
|
||||
//<pre>
|
||||
//<code><strong>输入：</strong>grid</code> = [[3,8,1,9],[19,7,2,5],[4,6,11,10],[12,0,21,13]], k = 4
|
||||
//<strong>输出：</strong>[[12,0,21,13],[3,8,1,9],[19,7,2,5],[4,6,11,10]]
|
||||
//</pre>
|
||||
//
|
||||
//<p><strong>示例 3：</strong></p>
|
||||
//
|
||||
//<pre>
|
||||
//<code><strong>输入：</strong>grid</code> = [[1,2,3],[4,5,6],[7,8,9]], k = 9
|
||||
//<strong>输出：</strong>[[1,2,3],[4,5,6],[7,8,9]]
|
||||
//</pre>
|
||||
//
|
||||
//<p> </p>
|
||||
//
|
||||
//<p><strong>提示：</strong></p>
|
||||
//
|
||||
//<ul>
|
||||
// <li><code>m == grid.length</code></li>
|
||||
// <li><code>n == grid[i].length</code></li>
|
||||
// <li><code>1 <= m <= 50</code></li>
|
||||
// <li><code>1 <= n <= 50</code></li>
|
||||
// <li><code>-1000 <= grid[i][j] <= 1000</code></li>
|
||||
// <li><code>0 <= k <= 100</code></li>
|
||||
//</ul>
|
||||
//<div><div>Related Topics</div><div><li>数组</li><li>矩阵</li><li>模拟</li></div></div><br><div><li>👍 86</li><li>👎 0</li></div>
|
||||
package leetcode.editor.cn;
|
||||
|
||||
import com.code.leet.entiy.TwoArray;
|
||||
|
||||
import java.util.ArrayList;
|
||||
import java.util.Arrays;
|
||||
import java.util.List;
|
||||
|
||||
// 1260:二维网格迁移
|
||||
public class Shift2dGrid {
|
||||
public static void main(String[] args) {
|
||||
Solution solution = new Shift2dGrid().new Solution();
|
||||
// TO TEST
|
||||
TwoArray twoArray = new TwoArray("[[1,2,3],[4,5,6],[7,8,9]]", true);
|
||||
solution.shiftGrid(twoArray.getArr(), 1);
|
||||
}
|
||||
|
||||
//leetcode submit region begin(Prohibit modification and deletion)
|
||||
class Solution {
|
||||
public List<List<Integer>> shiftGrid(int[][] grid, int k) {
|
||||
int x = grid.length;
|
||||
int y = grid[0].length;
|
||||
k %= (x * y);
|
||||
List<List<Integer>> list = new ArrayList<>();
|
||||
int[][] tmp = new int[x][y];
|
||||
for (int i = 0; i < x; i++) {
|
||||
for (int j = 0; j < y; j++) {
|
||||
int yy = j + (k % y);
|
||||
int xx = (k / y + i + (yy >= y ? 1 : 0)) % x;
|
||||
yy %= y;
|
||||
tmp[xx][yy] = grid[i][j];
|
||||
}
|
||||
}
|
||||
for (int i = 0; i < x; i++) {
|
||||
List<Integer> tmps = new ArrayList<>();
|
||||
for (int j = 0; j < y; j++) {
|
||||
tmps.add(tmp[i][j]);
|
||||
}
|
||||
list.add(tmps);
|
||||
}
|
||||
return list;
|
||||
}
|
||||
}
|
||||
//leetcode submit region end(Prohibit modification and deletion)
|
||||
|
||||
}
|
||||
52
src/main/java/leetcode/editor/cn/doc/content/Shift2dGrid.md
Normal file
52
src/main/java/leetcode/editor/cn/doc/content/Shift2dGrid.md
Normal file
@ -0,0 +1,52 @@
|
||||
<p>给你一个 <code>m</code> 行 <code>n</code> 列的二维网格 <code>grid</code> 和一个整数 <code>k</code>。你需要将 <code>grid</code> 迁移 <code>k</code> 次。</p>
|
||||
|
||||
<p>每次「迁移」操作将会引发下述活动：</p>
|
||||
|
||||
<ul>
|
||||
<li>位于 <code>grid[i][j]</code> 的元素将会移动到 <code>grid[i][j + 1]</code>。</li>
|
||||
<li>位于 <code>grid[i][n - 1]</code> 的元素将会移动到 <code>grid[i + 1][0]</code>。</li>
|
||||
<li>位于 <code>grid[m - 1][n - 1]</code> 的元素将会移动到 <code>grid[0][0]</code>。</li>
|
||||
</ul>
|
||||
|
||||
<p>请你返回 <code>k</code> 次迁移操作后最终得到的 <strong>二维网格</strong>。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>示例 1：</strong></p>
|
||||
|
||||
<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/11/16/e1-1.png" style="height: 158px; width: 400px;" /></p>
|
||||
|
||||
<pre>
|
||||
<code><strong>输入：</strong>grid</code> = [[1,2,3],[4,5,6],[7,8,9]], k = 1
|
||||
<strong>输出：</strong>[[9,1,2],[3,4,5],[6,7,8]]
|
||||
</pre>
|
||||
|
||||
<p><strong>示例 2：</strong></p>
|
||||
|
||||
<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/11/16/e2-1.png" style="height: 166px; width: 400px;" /></p>
|
||||
|
||||
<pre>
|
||||
<code><strong>输入：</strong>grid</code> = [[3,8,1,9],[19,7,2,5],[4,6,11,10],[12,0,21,13]], k = 4
|
||||
<strong>输出：</strong>[[12,0,21,13],[3,8,1,9],[19,7,2,5],[4,6,11,10]]
|
||||
</pre>
|
||||
|
||||
<p><strong>示例 3：</strong></p>
|
||||
|
||||
<pre>
|
||||
<code><strong>输入：</strong>grid</code> = [[1,2,3],[4,5,6],[7,8,9]], k = 9
|
||||
<strong>输出：</strong>[[1,2,3],[4,5,6],[7,8,9]]
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>提示：</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>m == grid.length</code></li>
|
||||
<li><code>n == grid[i].length</code></li>
|
||||
<li><code>1 <= m <= 50</code></li>
|
||||
<li><code>1 <= n <= 50</code></li>
|
||||
<li><code>-1000 <= grid[i][j] <= 1000</code></li>
|
||||
<li><code>0 <= k <= 100</code></li>
|
||||
</ul>
|
||||
<div><div>Related Topics</div><div><li>数组</li><li>矩阵</li><li>模拟</li></div></div><br><div><li>👍 86</li><li>👎 0</li></div>
|
||||
Loading…
Reference in New Issue
Block a user