lintcode671 循环单词

 1 class Solution {
 2 public:
 3     /*
 4      * @param words: A list of words
 5      * @return: Return how many different rotate words
 6      */
 7     int countRotateWords(vector<string> words) {
 8         // Write your code here
 9         if (words.empty()) return 0;
10 
11         int count = words.size();
12         bool *flag = new bool[count];
13         memset(flag, false, count);
14         for (int i = 0; i < count - 1; i++) {
15             if (flag[i] == true) {
16                 continue;
17             }
18             for (int j = i + 1; j < count; j++) {
19                 if (isSame(words[i], words[j])) {
20                     flag[j] = true;
21                 }
22             }
23         }
24         for (int i = 0; i < words.size(); i++) {
25             if (flag[i]) {
26                 count--;
27             }
28         }
29         return count;
30     }
31     bool isSame(string wordi, string wordj) {
32         if (wordi.length() != wordj.length()) {
33             return false;
34         }
35         wordi = wordi + wordi;
36         if (wordi.find(wordj) != string::npos) {
37             return true;
38         } else {
39             return false;
40         }
41     }
42 };