1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions

View File

@@ -12,7 +12,7 @@
"translatedContent": "<p>给你两个大小为 <code>n x n</code> 的二进制矩阵 <code>mat</code> 和 <code>target</code> 。现<strong> 以 90 度顺时针轮转 </strong>矩阵 <code>mat</code> 中的元素 <strong>若干次</strong> ,如果能够使 <code>mat</code> 与 <code>target</code> 一致,返回 <code>true</code> ;否则,返回<em> </em><code>false</code><em> 。</em></p>\n\n<p> </p>\n\n<p><strong>示例 1</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/05/20/grid3.png\" style=\"width: 301px; height: 121px;\" />\n<pre>\n<strong>输入:</strong>mat = [[0,1],[1,0]], target = [[1,0],[0,1]]\n<strong>输出:</strong>true\n<strong>解释:</strong>顺时针轮转 90 度一次可以使 mat 和 target 一致。\n</pre>\n\n<p><strong>示例 2</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/05/20/grid4.png\" style=\"width: 301px; height: 121px;\" />\n<pre>\n<strong>输入:</strong>mat = [[0,1],[1,1]], target = [[1,0],[0,1]]\n<strong>输出:</strong>false\n<strong>解释:</strong>无法通过轮转矩阵中的元素使 equal 与 target 一致。\n</pre>\n\n<p><strong>示例 3</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/05/26/grid4.png\" style=\"width: 661px; height: 184px;\" />\n<pre>\n<strong>输入:</strong>mat = [[0,0,0],[0,1,0],[1,1,1]], target = [[1,1,1],[0,1,0],[0,0,0]]\n<strong>输出:</strong>true\n<strong>解释:</strong>顺时针轮转 90 度两次可以使 mat 和 target 一致。\n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>n == mat.length == target.length</code></li>\n\t<li><code>n == mat[i].length == target[i].length</code></li>\n\t<li><code>1 <= n <= 10</code></li>\n\t<li><code>mat[i][j]</code> 和 <code>target[i][j]</code> 不是 <code>0</code> 就是 <code>1</code></li>\n</ul>\n",
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 17,
"likes": 18,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"6.7K\", \"totalSubmission\": \"11.7K\", \"totalAcceptedRaw\": 6720, \"totalSubmissionRaw\": 11671, \"acRate\": \"57.6%\"}",
"stats": "{\"totalAccepted\": \"6.8K\", \"totalSubmission\": \"11.8K\", \"totalAcceptedRaw\": 6772, \"totalSubmissionRaw\": 11760, \"acRate\": \"57.6%\"}",
"hints": [
"What is the maximum number of rotations you have to check?",
"Is there a formula you can use to rotate a matrix 90 degrees?"