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

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"11.9K\", \"totalSubmission\": \"21K\", \"totalAcceptedRaw\": 11862, \"totalSubmissionRaw\": 21031, \"acRate\": \"56.4%\"}",
"stats": "{\"totalAccepted\": \"11.9K\", \"totalSubmission\": \"21K\", \"totalAcceptedRaw\": 11865, \"totalSubmissionRaw\": 21034, \"acRate\": \"56.4%\"}",
"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.",