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/split-array-into-maximum-number-of-subarrays.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"2.7K\", \"totalSubmission\": \"5.5K\", \"totalAcceptedRaw\": 2708, \"totalSubmissionRaw\": 5498, \"acRate\": \"49.3%\"}",
"stats": "{\"totalAccepted\": \"2.7K\", \"totalSubmission\": \"5.5K\", \"totalAcceptedRaw\": 2709, \"totalSubmissionRaw\": 5499, \"acRate\": \"49.3%\"}",
"hints": [
"The minimum score will always be the bitwise <code>AND</code> of all elements of the array.",
"If the minimum score is not equal to <code>0</code>, the only possible split will be to keep all elements in one subarray.",