algorithm/Week_02/id_129/LeetCode_609_129.java at master · algorithm001/algorithm · GitHub

28 lines (26 loc) · 1003 Bytes

import java.util.*;

public class LeetCode_609_129 {

public List<List<String>> findDuplicate(String[] paths) {

List<List<String>> result = new ArrayList<>();

int n = paths.length;

if (n == 0) return result;

Map<String, Set<String>> map = new HashMap<>();

for (String path : paths) {

String[] strs = path.split("\\s+");

for (int i = 1; i < strs.length; i++) {

int idx = strs[i].indexOf("(");

String content = strs[i].substring(idx);

String filename = strs[0] + "/" + strs[i].substring(0, idx);

Set<String> filenames = map.getOrDefault(content, new HashSet<>());

filenames.add(filename);

map.put(content, filenames);

}

for (String key : map.keySet()) {

if (map.get(key).size() > 1) {

result.add(new ArrayList<>(map.get(key)));

}

return result;

}

Expand file tree