• Home
• com.github.javadev
• leetcode-in-java21
• 1.30
• 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.

g2901_3000.s2946_matrix_similarity_after_cyclic_shifts.readme.md Maven / Gradle / Ivy

2946\. Matrix Similarity After Cyclic Shifts

Easy

You are given a **0-indexed** `m x n` integer matrix `mat` and an integer `k`. You have to cyclically **right** shift **odd** indexed rows `k` times and cyclically **left** shift **even** indexed rows `k` times.

Return `true` _if the initial and final matrix are exactly the same and_ `false` _otherwise._

**Example 1:**

**Input:** mat = [[1,2,1,2],[5,5,5,5],[6,3,6,3]], k = 2

**Output:** true

**Explanation:** ![](https://assets.leetcode.com/uploads/2023/10/29/similarmatrix.png) Initially, the matrix looks like the first figure. Second figure represents the state of the matrix after one right and left cyclic shifts to even and odd indexed rows. Third figure is the final state of the matrix after two cyclic shifts which is similar to the initial matrix. Therefore, return true.

**Example 2:**

**Input:** mat = [[2,2],[2,2]], k = 3

**Output:** true

**Explanation:** As all the values are equal in the matrix, even after performing cyclic shifts the matrix will remain the same. Therefeore, we return true.

**Example 3:**

**Input:** mat = [[1,2]], k = 1

**Output:** false

**Explanation:** After one cyclic shift, mat = [[2,1]] which is not equal to the initial matrix. Therefore we return false.

**Constraints:**

*   `1 <= mat.length <= 25`
*   `1 <= mat[i].length <= 25`
*   `1 <= mat[i][j] <= 25`
*   `1 <= k <= 50`