leetcode 面试题 01.09. 字符串轮转

面试题 01.09. 字符串轮转

难度简单21

字符串轮转。给定两个字符串s1和s2，请编写代码检查s2是否为s1旋转而成（比如，waterbottle是erbottlewat旋转后的字符串）。

示例1:

 输入：s1 = "waterbottle", s2 = "erbottlewat"
 输出：True

示例2:

 输入：s1 = "aa", "aba"
 输出：False

class Solution:
    def isFlipedString(self, s1: str, s2: str) -> bool:
        if s1 ==s2:
            return True
        count = 0
        for i in s1:
            s1 = s1[1:]+s1[0]
            if s1 == s2:
                return True
        
        return False



class Solution:
    def isFlipedString(self, s1: str, s2: str) -> bool:
        if s1=='' and s2=='':
            return True
        if len(s1) != len(s2) :
            return False
        N = len(s2)
        i,j = 0,0
        while i<N:
            if s1[i] != s2[j]:
                i+=1
            else :
                if s1[i:] == s2[:N-i] and s1[:i] ==s2[N-i:]:
                    return True
                else :
                    i+=1
        return False