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"]]

Note:

1. No order is required for the final output.
2. You may assume the directory name, file name and file content only has letters and digits, and the length of file content is in the range of [1,50].
3. The number of files given is in the range of [1,20000].
4. You may assume no files or directories share the same name in the same directory.
5. You may assume each given directory info represents a unique directory. Directory path and file info are separated by a single blank space.

Follow-up beyond contest:

1. Imagine you are given a real file system, how will you search files? DFS or BFS?
2. If the file content is very large (GB level), how will you modify your solution?
3. If you can only read the file by 1kb each time, how will you modify your solution?
4. What is the time complexity of your modified solution? What is the most time-consuming part and memory consuming part of it? How to optimize?
5. How to make sure the duplicated files you find are not false positive?

思路：这个题很无聊，就是一个reverted index的hashmap的解法。把content找出来之后，然后group directory path，最后如果size > 1, 收集起来输出。这个题我觉得核心考点还是在follow up上面，

file很多，如何快速的确定是否有重复，那么就用到system design的知识，在GFS中，file都是以chunk的形式(64MB)的存在大型系统里面的，而且是master slave的结构，master只存metadata，每次我们只需要check metadata，然后checksum就可以了，如果还需要提速的话，那么我们可以加入bloom filter，false positive，说不在肯定不在，但是说在，不一定在，那么我们check一下positive的时候就可以了。

class Solution {
    public List<List<String>> findDuplicate(String[] paths) {
        HashMap<String, List<String>> hashmap = new HashMap<>();
        for(String path: paths) {
            String[] splits = path.split(" ");
            String root = splits[0];
            for(int i = 1; i < splits.length; i++) {
                String content = splits[i].substring(splits[i].indexOf("("), splits[i].indexOf(")"));
                hashmap.putIfAbsent(content, new ArrayList<>());
                hashmap.get(content).add(root + "/" + splits[i].substring(0, splits[i].indexOf("(")));
            }
        }
        
        List<List<String>> lists = new ArrayList<List<String>>();
        for(String key: hashmap.keySet()) {
            List<String> list = hashmap.get(key);
            if(list.size() > 1) {
                lists.add(list);
            }
        }
        return lists;
    }
}