Cracking The Coding Interview 1.8
2014-04-03 12:25
323 查看
//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 //( i.e., “waterbottle” is a rotation of “erbottlewat”). // // 题意:先写一个判断是否为字串的函数,然后写一个是否是旋转串的函数,调用一次是否为字串函数,来判断是否为旋转串 // 下面的方法来自于http://hawstein.com/posts/ctci-solutions-contents.html #include <iostream> #include <string> using namespace std; bool isSubstring(string s1, string s2) { if(s1.find(s2) != string::npos) return true; else return false; } bool isRotation(string s1, string s2) { if(s1.length() != s2.length() || s1.length()<=0) return false; return isSubstring(s1+s1, s2); } int main() { string s1= "kfuc"; string s2= "fuck"; cout<<isRotation(s1,s2)<<endl; return 0; }
相关文章推荐
- Cracking the Coding Interview Q1.8
- cracking the coding interview problem solution 1.8
- cracking the coding interview No1.8
- Cracking the coding interview--Q2.5
- Cracking the coding interview--Q9.7
- Cracking the coding interview--Q2.1
- 《Cracking the Coding Interview》——第1章:数组和字符串——题目3
- 《Cracking the Coding Interview》——第4章:树和图——题目5
- Cracking the Coding Interview Q1.6
- 《Cracking the Coding Interview》——第6章:智力题——题目6
- 《Cracking the Coding Interview》——第9章:递归和动态规划——题目9
- Cracking the coding interview Q1.2
- Cracking the coding interview--Q17.3
- Cracking the coding interview--Q19.1
- Cracking the coding interview--Q2.1
- Cracking the coding interview--Q2.3
- Cracking the Coding Interview-ch11 | System Design and Memory Limits
- Cracking the coding interview--Q19.5
- Cracking The Coding Interview 4.2_暂存
- Cracking the coding interview--Q1.6