coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 08:21: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/maximize-the-topmost-element-after-k-moves.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9.7K\", \"totalSubmission\": \"44K\", \"totalAcceptedRaw\": 9665, \"totalSubmissionRaw\": 44024, \"acRate\": \"22.0%\"}",
"stats": "{\"totalAccepted\": \"9.7K\", \"totalSubmission\": \"44K\", \"totalAcceptedRaw\": 9666, \"totalSubmissionRaw\": 44027, \"acRate\": \"22.0%\"}",
"hints": [
"For each index i, how can we check if nums[i] can be present at the top of the pile or not after k moves?",
"For which conditions will we end up with an empty pile?"