1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
|
// 839. Similar String Groups
#include "leetcode.h"
/*
* two strings 'x' and 'y' are similar if we can swap two letters
* of 'x' so that it equals 'y'. also two strings 'x' and 'y' are
* given a list of 'strs' of strings where every string in 'strs'
* is an anagram of every other string in 'strs'. how many groups?
*/
class disjointSet {
vector<int> v;
int sz;
public:
void make_set(int n) {
v.resize(n);
iota(v.begin(), v.end(), 0);
sz = n;
}
disjointSet(int n) { make_set(n); }
int find(int i) {
if (i != v[i])
v[i] = find(v[i]);
return v[i];
}
void join(int i, int j) {
int r_i = find(i), r_j = find(j);
if (r_i != r_j) {
v[r_i] = r_j;
sz--;
}
}
int size() { return sz; }
};
class Solution {
bool similar(string a, string b) {
int n = 0;
for (int i = 0; i < a.size(); i++)
if (a[i] != b[i] && ++n > 2)
return false;
return true;
}
public:
int numSimilarGroups(vector<string> &strs) {
disjointSet ds(strs.size());
for (int i = 0; i < strs.size(); i++)
for (int j = i + 1; j < strs.size(); j++)
if (similar(strs[i], strs[j]))
ds.join(i, j);
return ds.size();
}
};
int main() {
Solution obj;
vector<string> s1 = {"tars", "rats", "arts", "star"};
vector<string> s2 = {"omv", "ovm"};
printf("%d\n", obj.numSimilarGroups(s1));
printf("%d\n", obj.numSimilarGroups(s2));
}
|