mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-02 14:12:17 +08:00
update
This commit is contained in:
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"41.2K\", \"totalSubmission\": \"75.1K\", \"totalAcceptedRaw\": 41239, \"totalSubmissionRaw\": 75118, \"acRate\": \"54.9%\"}",
|
||||
"stats": "{\"totalAccepted\": \"41.3K\", \"totalSubmission\": \"75.3K\", \"totalAcceptedRaw\": 41335, \"totalSubmissionRaw\": 75298, \"acRate\": \"54.9%\"}",
|
||||
"hints": [
|
||||
"如果一个字符串是另一个字符串的旋转,那么它就是在某个特定点上的旋转。例如,字符串waterbottle在3处的旋转意味着在第三个字符处切割waterbottle,并在左半部分(wat)之前放置右半部分(erbottle)。",
|
||||
"本质上,我们是在寻找是否有一种方式可以把第一个字符串分成两部分,即x和y,如此一来,第一个字符串就是xy,第二个字符串就是yx。例如,x = wat,y = erbottle。那么,第一个字符串xy = waterbottle,第二个字符串yx = erbottlewat。",
|
||||
|
Reference in New Issue
Block a user