mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-12-18 10:04:58 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p>给定包含多个点的集合,从其中取三个点组成三角形,返回能组成的最大三角形的面积。</p>\n\n<pre>\n<strong>示例:</strong>\n<strong>输入:</strong> points = [[0,0],[0,1],[1,0],[0,2],[2,0]]\n<strong>输出:</strong> 2\n<strong>解释:</strong> \n这五个点如下图所示。组成的橙色三角形是最大的,面积为2。\n</pre>\n\n<p><img alt=\"\" src=\"https://s3-lc-upload.s3.amazonaws.com/uploads/2018/04/04/1027.png\" style=\"height:328px; width:400px\" /></p>\n\n<p><strong>注意: </strong></p>\n\n<ul>\n\t<li><code>3 <= points.length <= 50</code>.</li>\n\t<li>不存在重复的点。</li>\n\t<li> <code>-50 <= points[i][j] <= 50</code>.</li>\n\t<li>结果误差值在 <code>10^-6</code> 以内都认为是正确答案。</li>\n</ul>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Easy",
|
||||
"likes": 97,
|
||||
"likes": 102,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Largest Perimeter Triangle\", \"titleSlug\": \"largest-perimeter-triangle\", \"difficulty\": \"Easy\", \"translatedTitle\": \"\\u4e09\\u89d2\\u5f62\\u7684\\u6700\\u5927\\u5468\\u957f\"}]",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"12.6K\", \"totalSubmission\": \"19.9K\", \"totalAcceptedRaw\": 12636, \"totalSubmissionRaw\": 19896, \"acRate\": \"63.5%\"}",
|
||||
"stats": "{\"totalAccepted\": \"13.1K\", \"totalSubmission\": \"20.6K\", \"totalAcceptedRaw\": 13057, \"totalSubmissionRaw\": 20640, \"acRate\": \"63.3%\"}",
|
||||
"hints": [],
|
||||
"solution": null,
|
||||
"status": null,
|
||||
|
||||
Reference in New Issue
Block a user