1
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
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

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 285,
"dislikes": 93,
"likes": 305,
"dislikes": 99,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[\"DetectSquares\",\"add\",\"add\",\"add\",\"count\",\"count\",\"add\",\"count\"]\n[[],[[3,10]],[[11,2]],[[3,2]],[[11,10]],[[14,8]],[[11,2]],[[11,10]]]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"16.8K\", \"totalSubmission\": \"36.9K\", \"totalAcceptedRaw\": 16794, \"totalSubmissionRaw\": 36888, \"acRate\": \"45.5%\"}",
"stats": "{\"totalAccepted\": \"19.2K\", \"totalSubmission\": \"41.4K\", \"totalAcceptedRaw\": 19223, \"totalSubmissionRaw\": 41415, \"acRate\": \"46.4%\"}",
"hints": [
"Maintain the frequency of all the points in a hash map.",
"Traverse the hash map and if any point has the same y-coordinate as the query point, consider this point and the query point to form one of the horizontal lines of the square."