coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-22 05:26: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/minimum-adjacent-swaps-for-k-consecutive-ones.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"1.6K\", \"totalSubmission\": \"4.3K\", \"totalAcceptedRaw\": 1645, \"totalSubmissionRaw\": 4275, \"acRate\": \"38.5%\"}",
"stats": "{\"totalAccepted\": \"1.6K\", \"totalSubmission\": \"4.3K\", \"totalAcceptedRaw\": 1648, \"totalSubmissionRaw\": 4300, \"acRate\": \"38.3%\"}",
"hints": [
"Choose k 1s and determine how many steps are required to move them into 1 group.",
"Maintain a sliding window of k 1s, and maintain the steps required to group them.",