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

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"6.9K\", \"totalSubmission\": \"34.8K\", \"totalAcceptedRaw\": 6876, \"totalSubmissionRaw\": 34759, \"acRate\": \"19.8%\"}",
"stats": "{\"totalAccepted\": \"6.9K\", \"totalSubmission\": \"34.9K\", \"totalAcceptedRaw\": 6922, \"totalSubmissionRaw\": 34882, \"acRate\": \"19.8%\"}",
"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?"