mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
update
This commit is contained in:
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"4.5K\", \"totalSubmission\": \"12.4K\", \"totalAcceptedRaw\": 4521, \"totalSubmissionRaw\": 12440, \"acRate\": \"36.3%\"}",
|
||||
"stats": "{\"totalAccepted\": \"4.5K\", \"totalSubmission\": \"12.4K\", \"totalAcceptedRaw\": 4526, \"totalSubmissionRaw\": 12447, \"acRate\": \"36.4%\"}",
|
||||
"hints": [
|
||||
"If there is an optimal solution, you can always move the circle so that two points lie on the boundary of the circle.",
|
||||
"When the radius is fixed, you can find either 0 or 1 or 2 circles that pass two given points at the same time.",
|
||||
|
Reference in New Issue
Block a user