coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11: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

6
leetcode/originData/find-lucky-integer-in-an-array.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 607,
"dislikes": 19,
"likes": 631,
"dislikes": 20,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[2,2,3,4]\n[1,2,2,3,3,3]\n[2,2,2,3,3]",
@@ -131,7 +131,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"67.1K\", \"totalSubmission\": \"105.5K\", \"totalAcceptedRaw\": 67077, \"totalSubmissionRaw\": 105501, \"acRate\": \"63.6%\"}",
"stats": "{\"totalAccepted\": \"68.4K\", \"totalSubmission\": \"107.7K\", \"totalAcceptedRaw\": 68432, \"totalSubmissionRaw\": 107697, \"acRate\": \"63.5%\"}",
"hints": [
"Count the frequency of each integer in the array.",
"Get all lucky numbers and return the largest of them."