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-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/array-partition-i.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 750,
"dislikes": 127,
"likes": 755,
"dislikes": 128,
"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}]",
"exampleTestcases": "[1,4,3,2]\n[6,2,6,5,1,2]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"319.3K\", \"totalSubmission\": \"423.2K\", \"totalAcceptedRaw\": 319330, \"totalSubmissionRaw\": 423174, \"acRate\": \"75.5%\"}",
"stats": "{\"totalAccepted\": \"319.7K\", \"totalSubmission\": \"423.6K\", \"totalAcceptedRaw\": 319662, \"totalSubmissionRaw\": 423577, \"acRate\": \"75.5%\"}",
"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.",