• Home
• com.github.javadev
• leetcode-in-java
• 1.38
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g1901_2000.s1914_cyclically_rotating_a_grid.readme.md Maven / Gradle / Ivy

1914\. Cyclically Rotating a Grid

Medium

You are given an `m x n` integer matrix `grid`, where `m` and `n` are both **even** integers, and an integer `k`.

The matrix is composed of several layers, which is shown in the below image, where each color is its own layer:

![](https://assets.leetcode.com/uploads/2021/06/10/ringofgrid.png)

A cyclic rotation of the matrix is done by cyclically rotating **each layer** in the matrix. To cyclically rotate a layer once, each element in the layer will take the place of the adjacent element in the **counter-clockwise** direction. An example rotation is shown below:

![](https://assets.leetcode.com/uploads/2021/06/22/explanation_grid.jpg)

Return _the matrix after applying_ `k` _cyclic rotations to it_.

**Example 1:**

![](https://assets.leetcode.com/uploads/2021/06/19/rod2.png)

**Input:** grid = [[40,10],[30,20]], k = 1

**Output:** [[10,20],[40,30]]

**Explanation:** The figures above represent the grid at every state.

**Example 2:**

**![](https://assets.leetcode.com/uploads/2021/06/10/ringofgrid5.png)** **![](https://assets.leetcode.com/uploads/2021/06/10/ringofgrid6.png)** **![](https://assets.leetcode.com/uploads/2021/06/10/ringofgrid7.png)**

**Input:** grid = [[1,2,3,4],[5,6,7,8],[9,10,11,12],[13,14,15,16]], k = 2

**Output:** [[3,4,8,12],[2,11,10,16],[1,7,6,15],[5,9,13,14]]

**Explanation:** The figures above represent the grid at every state.

**Constraints:**

*   `m == grid.length`
*   `n == grid[i].length`
*   `2 <= m, n <= 50`
*   Both `m` and `n` are **even** integers.
*   `1 <= grid[i][j] <= 5000`
*   1 <= k <= 109