leetcode

0 class Solution {

1 public:

2 int numSpecialEquivGroups(const vector<string> &words) {

3 unordered_set<string> st;

4 const int n = words[0].size();

5 for (const auto &word : words) {

6 string s1, s2;

7 for (int i = 0; i < n; i += 2)

8 s1 += word[i];

9 for (int i = 1; i < n; i += 2)

10 s2 += word[i];

11 sort(begin(s1), end(s1));

12 sort(begin(s2), end(s2));

13 st.insert(s1 + ' ' + s2);

14 }

15 return st.size();

16 }

17 };