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/richest-customer-wealth.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 1717,
"dislikes": 253,
"likes": 1789,
"dislikes": 257,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[[1,2,3],[3,2,1]]\n[[1,5],[7,3],[3,5]]\n[[2,8,7],[7,1,3],[1,9,5]]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"266.7K\", \"totalSubmission\": \"298.4K\", \"totalAcceptedRaw\": 266652, \"totalSubmissionRaw\": 298447, \"acRate\": \"89.3%\"}",
"stats": "{\"totalAccepted\": \"281.1K\", \"totalSubmission\": \"314.9K\", \"totalAcceptedRaw\": 281131, \"totalSubmissionRaw\": 314908, \"acRate\": \"89.3%\"}",
"hints": [
"Calculate the wealth of each customer",
"Find the maximum element in array."