coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-22 21:46:46 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/maximum-number-of-ways-to-partition-an-array.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"1.6K\", \"totalSubmission\": \"5.8K\", \"totalAcceptedRaw\": 1591, \"totalSubmissionRaw\": 5769, \"acRate\": \"27.6%\"}",
"stats": "{\"totalAccepted\": \"1.6K\", \"totalSubmission\": \"5.8K\", \"totalAcceptedRaw\": 1602, \"totalSubmissionRaw\": 5801, \"acRate\": \"27.6%\"}",
"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.",