mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-25 23:08:57 +08:00
update
This commit is contained in:
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"14.2K\", \"totalSubmission\": \"37.2K\", \"totalAcceptedRaw\": 14183, \"totalSubmissionRaw\": 37188, \"acRate\": \"38.1%\"}",
|
||||
"stats": "{\"totalAccepted\": \"14.2K\", \"totalSubmission\": \"37.3K\", \"totalAcceptedRaw\": 14227, \"totalSubmissionRaw\": 37272, \"acRate\": \"38.2%\"}",
|
||||
"hints": [
|
||||
"先试试蛮力解法。你能尝试一切可能性吗?",
|
||||
"把0翻转到1可以合并两个1 的序列,但只有在这两个序列仅被一个0分隔时才可以。",
|
||||
|
||||
Reference in New Issue
Block a user