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

4
leetcode/originData/minimum-reverse-operations.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 218,
"likes": 219,
"dislikes": 65,
"isLiked": null,
"similarQuestions": "[]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.8K\", \"totalSubmission\": \"24.7K\", \"totalAcceptedRaw\": 3762, \"totalSubmissionRaw\": 24691, \"acRate\": \"15.2%\"}",
"stats": "{\"totalAccepted\": \"3.8K\", \"totalSubmission\": \"24.7K\", \"totalAcceptedRaw\": 3765, \"totalSubmissionRaw\": 24701, \"acRate\": \"15.2%\"}",
"hints": [
"Can we use a breadth-first search to find the minimum number of operations?",
"Find the beginning and end indices of the subarray of size k that can be reversed to bring 1 to a particular position.",