[第二轮] 2/25-3/3 CareerCup 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").

发帖规范:
http://www.1point3acres.com/bbs/thread-48094-1-1.html
http://www.1point3acres.com/bbs/thread-32423-1-1.html

1. two string should always have same length

2. ppl can always check if the "waterbottle" is a substring of "erbottlewat" concatenate with "erbottlewat";


https://gist.github.com/mazl123321/5022442

if function SubString(s1, s2) is used to check whether s2 is a substring of s1, then call it as SubString(s1+s1, s2);
https://gist.github.com/chrislukkk/5022525

Same idea as ls~, but also we have to check the length first.
https://gist.github.com/krisliu/5022784

https://gist.github.com/ThunderXu/5023045
1. Judge whether two strings equal in length
2. Judge whether two strings equals, if equal return true, else return IsSubString(s2+s2,s1)

The method is the same with others。
https://github.com/moophis/careercup/blob/master/1.8.cpp

https://gist.github.com/mettaworld/5026684
Java language
write a algorithm to judge whether a word is the substring of the other.
Then judge the rotation with two criteria: First compare their length, then judge whether waterbottle is the substring of erbottle"waterbottle"wat

same idea
C language:https://gist.github.com/hukun01/5026990

https://github.com/quantumrose/C ... 1.8.IsRotation.java

same- -