LeetCode 796 Rotate String

最新推荐文章于 2022-04-12 13:41:52 发布

我成为一只小羊

最新推荐文章于 2022-04-12 13:41:52 发布

阅读量337

点赞数

本文链接：https://blog.csdn.net/Exupery_/article/details/79518679

版权

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.

代码

class Solution {
public:
    bool rotateString(string A, string B) {
        int len = (int)A.length();
        for(int i=0;i<len;++i){
            if(A.substr(i,len)+A.substr(0,i)==B)
                return true;
        }
        return false;
    }
};