-
-
Notifications
You must be signed in to change notification settings - Fork 608
/
Copy pathFindDuplicateFileinSystem.java
55 lines (48 loc) · 1.3 KB
/
FindDuplicateFileinSystem.java
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
package problems.medium;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
/**
* Created by sherxon on 6/3/17.
*/
public class FindDuplicateFileinSystem {
public List<List<String>> findDuplicate(String[] a) {
List<List<String>> list = new ArrayList<>();
if (a.length == 0) {
return list;
}
Map<String, Set<String>> map = new HashMap<>();
for (String s : a) {
char[] c = s.toCharArray();
int ii = -1, jj = -1, ij = -1;
for (int i = 0; i < c.length; i++) {
if (c[i] == ' ') {
ij = i;
} else if (c[i] == '(') {
ii = i;
} else if (c[i] == ')') {
jj = i;
String content = s.substring(ii, jj + 1);
String path = s.substring(0, s.split(" ")[0].length());
String filename = s.substring(ij + 1, ii);
if (!map.containsKey(content)) {
map.put(content, new HashSet<>());
}
map.get(content).add(path + "/" + filename);
ii = -1;
jj = -1;
}
}
}
for (String s : map.keySet()) {
if (map.get(s).size() > 1) {
List<String> l = new ArrayList<>(map.get(s));
list.add(l);
}
}
return list;
}
}