leetcode 796.Rotate String(python3)

leetcode 796.Rotate String(python3)

---

原题地址：https://leetcode.com/problems/rotate-string/

题目

We are given two strings, A and B.

A shift on A consists of taking string A and moving the leftmost character to the rightmost position. For example, if A = ‘abcde’, then it will be ‘bcdea’ after one shift on A. Return True if and only if A can become B after some number of shifts on A.

Example 1:
Input: A = 'abcde', B = 'cdeab'
Output: true

Example 2:
Input: A = 'abcde', B = 'abced'
Output: false

Note:

• A and B will have length at most 100.

分析

本题是判断在给字符串A进行循环左移若干步，能否与字符串B相等。这里使用python3中简单的字符串拼接来解，以下是代码。

代码块

class Solution:
    def rotateString(self, A, B):
        """
        :type A: str
        :type B: str
        :rtype: bool
        """
        m,n = len(A),len(B)
        if m!=n:
            return False
        if A == B:
            return True
        for i in range(1,m):
            if A[i:] + A[0:i] == B:
                return True
        return False

版权声明：转载注明 http://blog.csdn.net/birdreamer/article/details/79518425