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 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

4
leetcode/originData/maximize-the-topmost-element-after-k-moves.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 244,
"likes": 249,
"dislikes": 180,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Gas Station\", \"titleSlug\": \"gas-station\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"13.3K\", \"totalSubmission\": \"62.1K\", \"totalAcceptedRaw\": 13278, \"totalSubmissionRaw\": 62093, \"acRate\": \"21.4%\"}",
"stats": "{\"totalAccepted\": \"13.5K\", \"totalSubmission\": \"62.7K\", \"totalAcceptedRaw\": 13492, \"totalSubmissionRaw\": 62660, \"acRate\": \"21.5%\"}",
"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?"