1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-12-18 18:14:59 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions

View File

@@ -12,7 +12,7 @@
"translatedContent": "<p>给定M&times;N矩阵每一行、每一列都按升序排列请编写代码找出某元素。</p>\n\n<p><strong>示例:</strong></p>\n\n<p>现有矩阵 matrix 如下:</p>\n\n<pre>[\n [1, 4, 7, 11, 15],\n [2, 5, 8, 12, 19],\n [3, 6, 9, 16, 22],\n [10, 13, 14, 17, 24],\n [18, 21, 23, 26, 30]\n]\n</pre>\n\n<p>给定 target&nbsp;=&nbsp;<code>5</code>,返回&nbsp;<code>true</code>。</p>\n\n<p>给定&nbsp;target&nbsp;=&nbsp;<code>20</code>,返回&nbsp;<code>false</code>。</p>\n",
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 37,
"likes": 40,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -101,7 +101,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"15.3K\", \"totalSubmission\": \"33.7K\", \"totalAcceptedRaw\": 15316, \"totalSubmissionRaw\": 33732, \"acRate\": \"45.4%\"}",
"stats": "{\"totalAccepted\": \"15.8K\", \"totalSubmission\": \"34.8K\", \"totalAcceptedRaw\": 15781, \"totalSubmissionRaw\": 34796, \"acRate\": \"45.4%\"}",
"hints": [
"如果你正在考虑某个特定列,是否有办法快速消除该列(至少在某些情况下)?",
"由于每列都进行了排序,因此如果该值小于此列中的最小值,则可知该值不能位于此列中。除此以外还能告诉你什么?",