609. Find Duplicate File in System

609. Find Duplicate File in System

1 题目

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:
No order is required for the final output.
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].
The number of files given is in the range of [1,20000].
You may assume no files or directories share the same name in the same directory.
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:
Imagine you are given a real file system, how will you search files? DFS or BFS?
If the file content is very large (GB level), how will you modify your solution?
If you can only read the file by 1kb each time, how will you modify your solution?
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?
How to make sure the duplicated files you find are not false positive?

2 翻译

给出目录信息列表（包括目录路径）以及包含此目录中所有内容的所有文件，您需要根据路径找到文件系统中的所有重复文件组。

一组重复文件由至少两个具有完全相同内容的文件组成。

输入列表中的单个目录信息字符串具有以下格式：

“root/d1/d2/…/dm f1.txt(f1_content) f2.txt(f2_content) … fn.txt(fn_content)”

这意味着有ñ（文件f1.txt，f2.txt… fn.txt与内容f1_content，f2_content… fn_content，分别）的目录root/d1/d2/…/dm。请注意，n> = 1且m> = 0。如果m = 0，则表示目录只是根目录。

该输出是重复的文件路径组的列表。对于每个组，它包含具有相同内容的文件的所有文件路径。文件路径是具有以下格式的字符串：

“directory_path/file_name.txt”

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

注意：
最终输出不需要顺序。
您可以假定目录名，文件名和文件内容只有字母和数字，文件内容的长度在[1,50]的范围内。
给出的文件数在[1,20000]的范围内。
您可能认为没有文件或目录在同一目录中共享相同的名称。
您可以假设每个给定的目录信息表示一个唯一的目录。目录路径和文件信息由单个空格分隔。
超越竞争的后续行动：
想象一下，您将获得真实的文件系统，您将如何搜索文件？DFS或BFS？
如果文件内容非常大（GB级别），您将如何修改解决方案？
如果每次只能读取1kb的文件，你将如何修改解决方案？
修改解决方案的时间复杂度是多少？什么是最耗时的部分和内存消耗部分？如何优化？
如何确保您发现的重复文件不是假阳性？

3 解题思路

使用了hashmap将时间复杂度缩短到mnlogn，其中的很多部分内容能省时间就要省省，否则也很容易超时

public class Solution {
    public List<List<String>> findDuplicate(String[] paths) {
        Map<String,ArrayList<String>> map=new HashMap<>();
        for(String path:paths){
            String []file=path.split(" ");
            String root = file[0];
            for(int i=1;i<file.length;i++){
                String []content=file[i].split("[(]");
                ArrayList<String> nowContent = map.getOrDefault(content[1], new ArrayList<>());
                nowContent.add(root + "/" + content[0]);
                map.put(content[1], nowContent);
            }
        }
        List<List<String>> lls= new ArrayList<>();
        for (ArrayList<String> value : map.values()) {
            if(value.size()>1)
                lls.add(value);
        }  
        return lls;
    }
}

---

欢迎加入中科院开源软件自习室：631696396