mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-06 07:51:41 +08:00
update
This commit is contained in:
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"2.6K\", \"totalSubmission\": \"12.2K\", \"totalAcceptedRaw\": 2580, \"totalSubmissionRaw\": 12197, \"acRate\": \"21.2%\"}",
|
||||
"stats": "{\"totalAccepted\": \"2.6K\", \"totalSubmission\": \"12.2K\", \"totalAcceptedRaw\": 2582, \"totalSubmissionRaw\": 12201, \"acRate\": \"21.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.",
|
||||
|
Reference in New Issue
Block a user