cyclically-shift-rows-and-columns

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer <code>n</code>, a 2D integer array <code>grid</code> of size <code>n x n</code>, and two integer arrays <code>rowShift</code> and <code>colShift</code>, each of length <code>n</code>, where:

<ul>
	<li><code>rowShift[i]</code> represents the number of positions to cyclically shift the <code>ith</code> row of <code>grid</code> to the left.</li>
	<li><code>colShift[j]</code> represents the number of positions to cyclically shift the <code>jth</code> column of <code>grid</code> upward.</li>
</ul>

First, cyclically shift each row according to <code>rowShift</code>, then cyclically shift each column of the resulting grid according to <code>colShift</code>.

Return the resulting grid after performing all the shifts.

A cyclic left shift of a row by <code>k</code> positions moves the element at column <code>j</code> to column <code>(j - k + n) % n</code>. All other rows remain unchanged.

A cyclic upward shift of a column by <code>k</code> positions moves the element at row <code>i</code> to row <code>(i - k + n) % n</code>. All other columns remain unchanged.

&nbsp;
Example 1:

<div class="example-block">
Input: n = 2, <code>grid</code> = [[1,2],[3,4]], rowShift = [1,0], colShift = [0,1]

Output: [[2,4],[3,1]]

Explanation:

The <code>grid</code> changes as follows:

<img alt="" src="https://assets.leetcode.com/uploads/2026/08/18/4743-1.png" style="width: 760px; height: 92px;" />
</div>

Example 2:

<div class="example-block">
Input: n = 3, <code>grid</code> = [[1,2,3],[4,5,6],[7,8,9]], rowShift = [1,2,0], colShift = [2,2,1]

Output: [[7,8,5],[2,3,9],[6,4,1]]

Explanation:

The <code>grid</code> changes as follows:

<img alt="" src="https://assets.leetcode.com/uploads/2026/08/18/4743-2.png" style="width: 750px; height: 349px;" />
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n == grid.length == grid[i].length &lt;= 10</code></li>
	<li><code>1 &lt;= grid[i][j] &lt;= 100</code></li>
	<li><code>rowShift.length == colShift.length == n</code></li>
	<li><code>0 &lt;= rowShift[i], colShift[i] &lt; n</code></li>
</ul>

第 519 场周赛

weekly-contest-519

cyclicShift

Cyclically Shift Rows and Columns

给你一个整数 <code>n</code>、一个大小为 <code>n x n</code> 的二维整数数组 <code>grid</code>，以及两个长度均为 <code>n</code> 的整数数组 <code>rowShift</code> 和 <code>colShift</code>，其中：

<ul>
	<li><code>rowShift[i]</code> 表示将 <code>grid</code> 的第 <code>i</code>&nbsp;行向左&nbsp;循环移位&nbsp;的位数。</li>
	<li><code>colShift[j]</code> 表示将 <code>grid</code> 的第 <code>j</code>&nbsp;列向上&nbsp;循环移位&nbsp;的位数。</li>
</ul>

首先按照 <code>rowShift</code> 对每一行进行循环移位，然后按照 <code>colShift</code> 对每一列进行循环移位。

返回完成所有移位操作后的网格。

将第 <code>i</code>&nbsp;行向左&nbsp;循环移位 <code>k</code> 位时，只移动该行。原本位于第 <code>j</code> 列的元素会移动到第 <code>(j - k + n) % n</code> 列，其余各行保持不变。

将第 <code>j</code>&nbsp;列向上&nbsp;循环移位 <code>k</code> 位时，只移动该列。原本位于第 <code>i</code> 行的元素会移动到第 <code>(i - k + n) % n</code> 行，其余各列保持不变。

&nbsp;

示例 1：

<div class="example-block">
输入： n = 2, <code>grid</code> = [[1,2],[3,4]], rowShift = [1,0], colShift = [0,1]

输出： [[2,4],[3,1]]

解释：

<code>grid</code> 的变化过程如下：

<img alt="" src="https://assets.leetcode.com/uploads/2026/08/18/4743-1.png" style="width: 760px; height: 92px;" />
</div>

示例 2：

<div class="example-block">
输入： n = 3, <code>grid</code> = [[1,2,3],[4,5,6],[7,8,9]], rowShift = [1,2,0], colShift = [2,2,1]

输出： [[7,8,5],[2,3,9],[6,4,1]]

解释：

<code>grid</code> 的变化过程如下：

<img alt="" src="https://assets.leetcode.com/uploads/2026/08/18/4743-2.png" style="width: 750px; height: 349px;" />
</div>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= n == grid.length == grid[i].length &lt;= 10</code></li>
	<li><code>1 &lt;= grid[i][j] &lt;= 100</code></li>
	<li><code>rowShift.length == colShift.length == n</code></li>
	<li><code>0 &lt;= rowShift[i], colShift[i] &lt; n</code></li>
</ul>