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/minimum-adjacent-swaps-for-k-consecutive-ones.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5.6K\", \"totalSubmission\": \"14K\", \"totalAcceptedRaw\": 5633, \"totalSubmissionRaw\": 13973, \"acRate\": \"40.3%\"}",
"stats": "{\"totalAccepted\": \"5.6K\", \"totalSubmission\": \"14K\", \"totalAcceptedRaw\": 5642, \"totalSubmissionRaw\": 13999, \"acRate\": \"40.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.",