FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
LeetCode-Solutions/C++/similar-string-groups.cpp at master · Addoile/LeetCode-Solutions · GitHub
Addoile
/
LeetCode-Solutions
Public
forked from
kamyu104/LeetCode-Solutions
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
LeetCode-Solutions
/
C++
/
similar-string-groups.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
151 lines (137 loc) · 4.23 KB
Breadcrumbs
LeetCode-Solutions
/
C++
/
similar-string-groups.cpp
Copy path
File metadata and controls
151 lines (137 loc) · 4.23 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
//
Time: O(n^2 * l), l is the average length of words
//
Space: O(n)
class
Solution
{
public:
int
numSimilarGroups
(vector<string>& A) {
UnionFind
union_find
(A.
size
());
for
(
int
i =
0
; i < A.
size
(); ++i) {
for
(
int
j =
0
; j < i; ++j) {
if
(
isSimilar
(A[i], A[j])) {
union_find.
union_set
(i, j);
}
}
}
return
union_find.
size
();
}
private:
bool
isSimilar
(
const
string& a,
const
string& b) {
int
diff =
0
;
for
(
int
i =
0
; i < a.
length
(); ++i) {
if
(a[i] != b[i]) {
if
(++diff >
2
) {
return
false
;
}
}
}
return
diff ==
2
;
}
class
UnionFind
{
public:
UnionFind
(
const
int
n) : set_(n), size_(n) {
iota
(set_.
begin
(), set_.
end
(),
0
);
}
int
find_set
(
const
int
x) {
if
(set_[x] != x) {
set_[x] =
find_set
(set_[x]);
//
Path compression.
}
return
set_[x];
}
bool
union_set
(
const
int
x,
const
int
y) {
int
x_root =
find_set
(x), y_root =
find_set
(y);
if
(x_root == y_root) {
return
false
;
}
set_[
min
(x_root, y_root)] =
max
(x_root, y_root);
--size_;
return
true
;
}
int
size
()
const
{
return
size_;
}
private:
vector<
int
> set_;
int
size_;
};
};
//
Time: O(n^2 * l) ~ O(n * l^4)
//
Space: O(n) ~ O(n * l^3)
class
Solution_MLE
{
public:
int
numSimilarGroups
(vector<string>& A) {
const
int
N = A.
size
(), L = A[
0
].
length
();
UnionFind
union_find
(A.
size
());
if
(N < L*L) {
for
(
int
i =
0
; i < N; ++i) {
for
(
int
j =
0
; j < i; ++j) {
if
(
isSimilar
(A[i], A[j])) {
union_find.
union_set
(i, j);
}
}
}
}
else
{
unordered_map<string, vector<
int
>> buckets;
unordered_set<string> lookup;
for
(
int
i =
0
; i < A.
size
(); ++i) {
auto
word = A[i];
if
(!lookup.
count
(word)) {
buckets[word].
emplace_back
(i);
lookup.
emplace
(word);
}
for
(
int
j1 =
0
; j1 < L; ++j1) {
for
(
int
j2 =
0
; j2 < j1; ++j2) {
swap
(word[j1], word[j2]);
buckets[word].
emplace_back
(i);
swap
(word[j1], word[j2]);
}
}
}
for
(
const
auto
& word : A) {
for
(
int
i =
0
; i < buckets[word].
size
(); ++i) {
for
(
int
j =
0
; j < i; ++j) {
union_find.
union_set
(buckets[word][i], buckets[word][j]);
}
}
}
}
return
union_find.
size
();
}
private:
bool
isSimilar
(
const
string& a,
const
string& b) {
int
diff =
0
;
for
(
int
i =
0
; i < a.
length
(); ++i) {
if
(a[i] != b[i]) {
if
(++diff >
2
) {
return
false
;
}
}
}
return
diff ==
2
;
}
class
UnionFind
{
public:
UnionFind
(
const
int
n) : set_(n), size_(n) {
iota
(set_.
begin
(), set_.
end
(),
0
);
}
int
find_set
(
const
int
x) {
if
(set_[x] != x) {
set_[x] =
find_set
(set_[x]);
//
Path compression.
}
return
set_[x];
}
bool
union_set
(
const
int
x,
const
int
y) {
int
x_root =
find_set
(x), y_root =
find_set
(y);
if
(x_root == y_root) {
return
false
;
}
set_[
min
(x_root, y_root)] =
max
(x_root, y_root);
--size_;
return
true
;
}
int
size
()
const
{
return
size_;
}
private:
vector<
int
> set_;
int
size_;
};
};
Back
|
FazBrowse Home
|
New Git URL