大家好，我是毛毛。ヾ(´∀ ˋ)ﾉ
废话不多说开始今天的解题Day~

796. Rotate String

Question

Given two strings s and goal, return true if and only if s can become goal after some number of shifts on s.

A shift on s consists of moving the leftmost character of s to the rightmost position.

• For example, if s = "abcde", then it will be "bcdea" after one shift.

Example

Example1

Input: s = "abcde", goal = "cdeab"
Output: true

Example2

Input: s = "abcde", goal = "abced"
Output: false

Constraints

• 1 <= s.length, goal.length <= 100
• s and goal consist of lowercase English letters.

解题

题目

首先先简单的翻译一下题目
给一个字串s跟目标字串goal，要判断goal是不是可以透过位移s的字串来得到。

Think

作法大致上是这样

• s[index:]可以得到从index这个位置到s最後的所有字元，s[index]可以在得到从s的头到index前的所有字元，把两个加起来，就可以达到shift的效果。

Code

Python

class Solution:
    def rotateString(self, s: str, goal: str) -> bool:
        
        for index in range(len(s)):
            if (s[index:] + s[:index]) == goal:
                return True
            
        return False

Result

• Python
  • 

大家明天见