CareerCup 1.8

最新推荐文章于 2018-04-04 17:51:00 发布

原创最新推荐文章于 2018-04-04 17:51:00 发布 · 904 阅读

0 ·

CC 4.0 BY-SA版权

CareerCup 150 专栏收录该内容

30 篇文章

订阅专栏

本文介绍了一种使用isSubstring方法检查一个字符串是否为另一个字符串的旋转版本的方法。通过将原字符串拼接自身并调用一次isSubstring方法，即可高效判断两字符串间的关系。

1.8 Assume you have a method isSubstring which checks if one word is a substring of another. Given two strings, s1 and s2, write code to check if s2 is a rotation of s1 using only one call to isSubstring (e.g., "waterbottle" is a rotation of "erbottlewat").

bool isSubstring(string str, string substr) {
    return str.find(substr) != string::npos;
}

bool isRotation(string s1, string s2) {
    unsigned len = s1.length();
    if (s2.length() == len && len > 0) {
        return isSubstring(s1+s1, s2);
    }
    return false;
}