coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +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/maximum-number-of-ways-to-partition-an-array.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 262,
"dislikes": 23,
"likes": 270,
"dislikes": 25,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Partition Equal Subset Sum\", \"titleSlug\": \"partition-equal-subset-sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Partition to K Equal Sum Subsets\", \"titleSlug\": \"partition-to-k-equal-sum-subsets\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[2,-1,2]\n3\n[0,0,0]\n1\n[22,4,-25,-20,-15,15,-16,7,19,-10,0,-13,-14]\n-33",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4.7K\", \"totalSubmission\": \"15.2K\", \"totalAcceptedRaw\": 4708, \"totalSubmissionRaw\": 15191, \"acRate\": \"31.0%\"}",
"stats": "{\"totalAccepted\": \"5K\", \"totalSubmission\": \"15.8K\", \"totalAcceptedRaw\": 4955, \"totalSubmissionRaw\": 15827, \"acRate\": \"31.3%\"}",
"hints": [
"A pivot point splits the array into equal prefix and suffix. If no change is made to the array, the goal is to find the number of pivot p such that prefix[p-1] == suffix[p].",
"Consider how prefix and suffix will change when we change a number nums[i] to k.",