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

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/array-partition.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 1936,
"likes": 1937,
"dislikes": 238,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Minimum Difference Between Highest and Lowest of K Scores\", \"titleSlug\": \"minimum-difference-between-highest-and-lowest-of-k-scores\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Minimum Cost of Buying Candies With Discount\", \"titleSlug\": \"minimum-cost-of-buying-candies-with-discount\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"All Divisions With the Highest Score of a Binary Array\", \"titleSlug\": \"all-divisions-with-the-highest-score-of-a-binary-array\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"440.7K\", \"totalSubmission\": \"564.2K\", \"totalAcceptedRaw\": 440659, \"totalSubmissionRaw\": 564213, \"acRate\": \"78.1%\"}",
"stats": "{\"totalAccepted\": \"440.7K\", \"totalSubmission\": \"564.3K\", \"totalAcceptedRaw\": 440694, \"totalSubmissionRaw\": 564251, \"acRate\": \"78.1%\"}",
"hints": [
"Obviously, brute force won't help here. Think of something else, take some example like 1,2,3,4.",
"How will you make pairs to get the result? There must be some pattern.",