609. Find Duplicate File in System
609. Find Duplicate File in System
Given a list of directory info including directory path, and all the files with
contents in this directory, you need to find out all the groups of duplicate files
in the file system in terms of their paths.
A group of duplicate files consists of at least two files that have exactly the same content.
A single directory info string in the input list has the following format:
"root/d1/d2/.../dm f1.txt(f1_content) f2.txt(f2_content) ... fn.txt(fn_content)"
It means there are n files (f1.txt, f2.txt ... fn.txt with content f1_content,
f2_content ... fn_content, respectively) in directory root/d1/d2/.../dm. Note that
n >= 1 and m >= 0. If m = 0, it means the directory is just the root directory.
The output is a list of group of duplicate file paths. For each group, it contains all the
file paths of the files that have the same content. A file path is a string that has the
following format:
"directory_path/file_name.txt"
Example 1:
Input:
["root/a 1.txt(abcd) 2.txt(efgh)", "root/c 3.txt(abcd)", "root/c/d 4.txt(efgh)", "root 4.txt(efgh)"]
Output:
[["root/a/2.txt","root/c/d/4.txt","root/4.txt"],["root/a/1.txt","root/c/3.txt"]]
public List<String> letterCombinations(String digits) {
if(digits.length() == 0) return new ArrayList<>();
String[] dict = new String[10];
dict[2] = "abc";
dict[3] = "def";
dict[4] = "ghi";
dict[5] = "jkl";
dict[6] = "mno";
dict[7] = "pqrs";
dict[8] = "tuv";
dict[9] = "wxyz";
List<String> result = new ArrayList<>();
dfs(digits, result, dict, new StringBuilder(), 0);
return result;
}
public void dfs(String digits, List<String> result, String[] dict, StringBuilder sb, int i) {
if(i == digits.length()) {
result.add(sb.toString());
} else {
for(char c : dict[digits.charAt(i)-'0'].toCharArray()) {
sb.append(c);
dfs(digits, result, dict, sb, i+1);
sb.setLength(sb.length()-1);
}
}
}