coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
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
Download Patch File Download Diff File Expand all files Collapse all files

8
leetcode/originData/queries-on-number-of-points-inside-a-circle.json
View File

@@ -11,10 +11,10 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 507,
"dislikes": 52,
"likes": 541,
"dislikes": 54,
"isLiked": null,
"similarQuestions": "[]",
"similarQuestions": "[{\"title\": \"Count Lattice Points Inside a Circle\", \"titleSlug\": \"count-lattice-points-inside-a-circle\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Count Number of Rectangles Containing Each Point\", \"titleSlug\": \"count-number-of-rectangles-containing-each-point\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[[1,3],[3,3],[5,3],[2,2]]\n[[2,3,1],[4,3,1],[1,1,2]]\n[[1,1],[2,2],[3,3],[4,4],[5,5]]\n[[1,2,2],[2,2,2],[4,3,2],[4,3,3]]",
"categoryTitle": "Algorithms",
"contributors": [],
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"36.8K\", \"totalSubmission\": \"42.5K\", \"totalAcceptedRaw\": 36782, \"totalSubmissionRaw\": 42458, \"acRate\": \"86.6%\"}",
"stats": "{\"totalAccepted\": \"38.1K\", \"totalSubmission\": \"44K\", \"totalAcceptedRaw\": 38080, \"totalSubmissionRaw\": 44022, \"acRate\": \"86.5%\"}",
"hints": [
"For a point to be inside a circle, the euclidean distance between it and the circle's center needs to be less than or equal to the radius.",
"Brute force for each circle and iterate overall points and find those inside it."