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
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
| import java.util.*;
public class _30串联所有单词的子串 {
public List<Integer> findSubstring_gov(String s, String[] words) {
List<Integer> res = new ArrayList<Integer>();
int m = words.length, n = words[0].length(), ls = s.length();
for (int i = 0; i < n; i++) {
if (i + m * n > ls) {
break;
}
Map<String, Integer> differ = new HashMap<String, Integer>();
for (int j = 0; j < m; j++) {
String word = s.substring(i + j * n, i + (j + 1) * n);
differ.put(word, differ.getOrDefault(word, 0) + 1);
}
for (String word : words) {
differ.put(word, differ.getOrDefault(word, 0) - 1);
if (differ.get(word) == 0) {
differ.remove(word);
}
}
for (int start = i; start < ls - m * n + 1; start += n) {
if (start != i) {
String word = s.substring(start + (m - 1) * n, start + m * n);
differ.put(word, differ.getOrDefault(word, 0) + 1);
if (differ.get(word) == 0) {
differ.remove(word);
}
word = s.substring(start - n, start);
differ.put(word, differ.getOrDefault(word, 0) - 1);
if (differ.get(word) == 0) {
differ.remove(word);
}
}
if (differ.isEmpty()) {
res.add(start);
}
}
}
return res;
}
public List<Integer> findSubstring_slide_window_v2(String s, String[] words) {
Map<String, Integer> map = new HashMap<>();
wordLen = words[0].length();
wordsLen = words.length;
wordSumLen = wordsLen * wordLen;
for (String word : words) {
map.put(word, map.getOrDefault(word, 0) + 1);
}
List<Integer> res = new ArrayList<>();
for (int i = 0; i < wordLen; i++) {
nextDeal(res, map, s, i);
}
return res;
}
private void nextDeal(List<Integer> res, Map<String, Integer> map, String s, int index) {
Map<String, Integer> mapCur = new HashMap<>(map);
for (int i = 0; i < wordsLen && index + (i + 1) * wordLen <= s.length(); i++) {
updateMap(mapCur, s.substring(index + i * wordLen, index + (i + 1) * wordLen), false);
}
nextDealChild(res, mapCur, s, index + wordSumLen);
}
private void nextDealChild(List<Integer> res, Map<String, Integer> map, String s, int index) {
if (map.isEmpty()) {
res.add(index - wordSumLen);
}
if (index + wordLen > s.length()) {
return;
}
String addStr = s.substring(index, index + wordLen);
String deleteStr = s.substring(index - wordSumLen, index - wordSumLen + wordLen);
updateMap(map, addStr, true);
updateMap(map, deleteStr, false);
nextDealChild(res, map, s, index + wordLen);
}
int wordLen = 0;
int wordsLen = 0;
int wordSumLen = 0;
public List<Integer> findSubstring_slide_window(String s, String[] words) {
Map<String, Integer> map = new HashMap<>();
wordLen = words[0].length();
wordsLen = words.length;
wordSumLen = wordsLen * wordLen;
for (String word : words) {
map.put(word, map.getOrDefault(word, 0) + 1);
}
List<Integer> res = new ArrayList<>();
next(res, map, s, 0, true);
return res;
}
private void next(List<Integer> res, Map<String, Integer> map, String s, Integer index, boolean isFirst) {
if (map.isEmpty()) {
res.add(index - wordSumLen);
return;
}
List<String> keys = new ArrayList<>(map.keySet());
if (isFirst) {
for (int i = index; i <= s.length() - wordSumLen; i++) {
for (String key : keys) {
if (index + wordLen > s.length()) {
continue;
}
if (!Objects.equals(key, s.substring(i, i + wordLen))) {
continue;
}
updateMap(map, key, false);
next(res, map, s, i + wordLen, false);
updateMap(map, key, true);
}
}
} else {
for (String key : keys) {
if (index + wordLen > s.length()) {
continue;
}
if (!Objects.equals(key, s.substring(index, index + wordLen))) {
continue;
}
updateMap(map, key, false);
next(res, map, s, index + wordLen, false);
updateMap(map, key, true);
}
}
}
private void updateMap(Map<String, Integer> map, String key, boolean isInput) {
if (isInput) {
if (map.containsKey(key)) {
int counter = map.get(key) + 1;
if (counter == 0) {
map.remove(key);
} else {
map.put(key, counter);
}
} else {
map.put(key, 1);
}
} else {
if (map.containsKey(key)) {
int counter = map.get(key) - 1;
if (counter == 0) {
map.remove(key);
} else {
map.put(key, counter);
}
} else {
map.put(key, -1);
}
}
}
public List<Integer> findSubstring(String s, String[] words) {
List<List<String>> lists = permuteUnique_gov(words);
Set<String> set = new HashSet<>();
for (List<String> list : lists) {
StringBuilder sb = new StringBuilder();
for (String string : list) {
sb.append(string);
}
set.add(sb.toString());
}
List<Integer> res = new ArrayList<>();
for (String string : set) {
StringBuilder sb = new StringBuilder(s);
int index = sb.indexOf(string);
while (index != -1) {
res.add(index);
index = sb.indexOf(string, index + 1);
}
}
return res;
}
public List<List<String>> permuteUnique_gov(String[] nums) {
int len = nums.length;
List<List<String>> res = new ArrayList<>();
List<String> output = new ArrayList<>();
Arrays.sort(nums);
for (String num : nums) {
output.add(num);
}
backtrack(len, 0, output, res);
return res;
}
private void backtrack(int len, int index, List<String> output, List<List<String>> res) {
if (index == len) res.add(new ArrayList<>(output));
Set<String> set = new HashSet<>();
for (int i = index; i < len; i++) {
if (set.contains(output.get(i))) {
continue;
}
set.add(output.get(i));
Collections.swap(output, index, i);
backtrack(len, index + 1, output, res);
Collections.swap(output, index, i);
}
}
public static void main(String[] args) {
_30串联所有单词的子串 solution = new _30串联所有单词的子串();
System.out.println(solution.findSubstring_slide_window_v2("pjzkrkevzztxductzzxmxsvwjkxpvukmfjywwetvfnujhweiybwvvsrfequzkhossmootkmyxgjgfordrpapjuunmqnxxdrqrfgkrsjqbszgiqlcfnrpjlcwdrvbumtotzylshdvccdmsqoadfrpsvnwpizlwszrtyclhgilklydbmfhuywotjmktnwrfvizvnmfvvqfiokkdprznnnjycttprkxpuykhmpchiksyucbmtabiqkisgbhxngmhezrrqvayfsxauampdpxtafniiwfvdufhtwajrbkxtjzqjnfocdhekumttuqwovfjrgulhekcpjszyynadxhnttgmnxkduqmmyhzfnjhducesctufqbumxbamalqudeibljgbspeotkgvddcwgxidaiqcvgwykhbysjzlzfbupkqunuqtraxrlptivshhbihtsigtpipguhbhctcvubnhqipncyxfjebdnjyetnlnvmuxhzsdahkrscewabejifmxombiamxvauuitoltyymsarqcuuoezcbqpdaprxmsrickwpgwpsoplhugbikbkotzrtqkscekkgwjycfnvwfgdzogjzjvpcvixnsqsxacfwndzvrwrycwxrcismdhqapoojegggkocyrdtkzmiekhxoppctytvphjynrhtcvxcobxbcjjivtfjiwmduhzjokkbctweqtigwfhzorjlkpuuliaipbtfldinyetoybvugevwvhhhweejogrghllsouipabfafcxnhukcbtmxzshoyyufjhzadhrelweszbfgwpkzlwxkogyogutscvuhcllphshivnoteztpxsaoaacgxyaztuixhunrowzljqfqrahosheukhahhbiaxqzfmmwcjxountkevsvpbzjnilwpoermxrtlfroqoclexxisrdhvfsindffslyekrzwzqkpeocilatftymodgztjgybtyheqgcpwogdcjlnlesefgvimwbxcbzvaibspdjnrpqtyeilkcspknyylbwndvkffmzuriilxagyerjptbgeqgebiaqnvdubrtxibhvakcyotkfonmseszhczapxdlauexehhaireihxsplgdgmxfvaevrbadbwjbdrkfbbjjkgcztkcbwagtcnrtqryuqixtzhaakjlurnumzyovawrcjiwabuwretmdamfkxrgqgcdgbrdbnugzecbgyxxdqmisaqcyjkqrntxqmdrczxbebemcblftxplafnyoxqimkhcykwamvdsxjezkpgdpvopddptdfbprjustquhlazkjfluxrzopqdstulybnqvyknrchbphcarknnhhovweaqawdyxsqsqahkepluypwrzjegqtdoxfgzdkydeoxvrfhxusrujnmjzqrrlxglcmkiykldbiasnhrjbjekystzilrwkzhontwmehrfsrzfaqrbbxncphbzuuxeteshyrveamjsfiaharkcqxefghgceeixkdgkuboupxnwhnfigpkwnqdvzlydpidcljmflbccarbiegsmweklwngvygbqpescpeichmfidgsjmkvkofvkuehsmkkbocgejoiqcnafvuokelwuqsgkyoekaroptuvekfvmtxtqshcwsztkrzwrpabqrrhnlerxjojemcxel", new String[]{"dhvf", "sind", "ffsl", "yekr", "zwzq", "kpeo", "cila", "tfty", "modg", "ztjg", "ybty", "heqg", "cpwo", "gdcj", "lnle", "sefg", "vimw", "bxcb"}));
}
}
|