@@ -0,0 +1,945 @@
+public class Solution %7B%0A    /*%0A     * @param words: A list of words%0A     * @return: Return how many different rotate words%0A     */%0A    public int countRotateWords(List%3CString%3E words) %7B%0A        // Write your code here%0A%0A        int count = 0;%0A        for(int i = 0; i %3C words.size(); i ++) %7B%0A            %0A            if(words.get(i) != null) %7B%0A                String tmp = words.get(i) + words.get(i);%0A                words.set(i, null);%0A                %0A                int t = 0;%0A                for(int j = 0; j %3C words.size(); j ++) %7B%0A                    if(words.get(j) != null && tmp.contains(words.get(j)) %0A                        && tmp.length() == words.get(j).length() * 2) %7B%0A                        t ++;%0A                        words.set(j, null);%0A                    %7D%0A                %7D%0A                %0A                if(t %3E= 0) %7B%0A                    count ++;%0A                %7D%0A            %7D%0A        %7D%0A        return count;%0A    %7D%0A%7D

add 671