coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51: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

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

@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"2.7K\", \"totalSubmission\": \"8.6K\", \"totalAcceptedRaw\": 2654, \"totalSubmissionRaw\": 8614, \"acRate\": \"30.8%\"}",
"stats": "{\"totalAccepted\": \"2.7K\", \"totalSubmission\": \"8.6K\", \"totalAcceptedRaw\": 2655, \"totalSubmissionRaw\": 8617, \"acRate\": \"30.8%\"}",
"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.",