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

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

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4.7K\", \"totalSubmission\": \"15.1K\", \"totalAcceptedRaw\": 4682, \"totalSubmissionRaw\": 15124, \"acRate\": \"31.0%\"}",
"stats": "{\"totalAccepted\": \"4.7K\", \"totalSubmission\": \"15.2K\", \"totalAcceptedRaw\": 4708, \"totalSubmissionRaw\": 15191, \"acRate\": \"31.0%\"}",
"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.",