mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-08 08:51:42 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p>给定一个数组 <code>coordinates</code> ,其中 <code>coordinates[i] = [x, y]</code> ,<meta charset=\"UTF-8\" /> <code>[x, y]</code> 表示横坐标为 <code>x</code>、纵坐标为 <code>y</code> 的点。请你来判断,这些点是否在该坐标系中属于同一条直线上。</p>\n\n<p> </p>\n\n<p><strong>示例 1:</strong></p>\n\n<p><img alt=\"\" src=\"https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/10/19/untitled-diagram-2.jpg\" /></p>\n\n<pre>\n<strong>输入:</strong>coordinates = [[1,2],[2,3],[3,4],[4,5],[5,6],[6,7]]\n<strong>输出:</strong>true\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<p><strong><img alt=\"\" src=\"https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/10/19/untitled-diagram-1.jpg\" /></strong></p>\n\n<pre>\n<strong>输入:</strong>coordinates = [[1,1],[2,2],[3,4],[4,5],[5,6],[7,7]]\n<strong>输出:</strong>false\n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>2 <= coordinates.length <= 1000</code></li>\n\t<li><code>coordinates[i].length == 2</code></li>\n\t<li><code>-10^4 <= coordinates[i][0], coordinates[i][1] <= 10^4</code></li>\n\t<li><code>coordinates</code> 中不含重复的点</li>\n</ul>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Easy",
|
||||
"likes": 109,
|
||||
"likes": 112,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"37.6K\", \"totalSubmission\": \"80.8K\", \"totalAcceptedRaw\": 37629, \"totalSubmissionRaw\": 80850, \"acRate\": \"46.5%\"}",
|
||||
"stats": "{\"totalAccepted\": \"38.7K\", \"totalSubmission\": \"83.2K\", \"totalAcceptedRaw\": 38673, \"totalSubmissionRaw\": 83244, \"acRate\": \"46.5%\"}",
|
||||
"hints": [
|
||||
"If there're only 2 points, return true.",
|
||||
"Check if all other points lie on the line defined by the first 2 points.",
|
||||
|
Reference in New Issue
Block a user