【Leetcode_easy】796. Rotate String

problem

796. Rotate String

solution1:

class Solution {
public:
    bool rotateString(string A, string B) {
        if(A.size()!=B.size()) return false;
        if(A.size()==0 && B.size()==0) return true;//errr...
        for(int i=0; i<A.size(); ++i)
        {
            if(A.substr(i, A.size()-i)+A.substr(0, i) == B) return true;
        }
        return false;
    }
};

solution2:

class Solution {
public:
    bool rotateString(string A, string B) {
        return (A.size()==B.size() && ((A+A).find(B)!=string::npos));
    }
};

参考

1. Leetcode_easy_796. Rotate String;

2. Grandyang;

原文地址:https://www.cnblogs.com/happyamyhope/p/11205285.html