[leetcode-609-Find Duplicate File in System]

https://discuss.leetcode.com/topic/91430/c-clean-solution-answers-to-follow-upGiven 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?

思路：

首先就是将字符串处理成完整路径的形式，然后用map统计相同内容的文件路径。

void parse(string orign,string& fileName,string& content)
     {
         int index = orign.find_first_of('(');
         fileName = orign.substr(, index);
         content = orign.substr(index + ,orign.length()-index-);
     }
    void getFullPath(string p,vector<string>&path,vector<string>&conVec)
     {
         stringstream ss(p);
         string pathPrefix;
         ss >> pathPrefix;
         string file;
         while (ss >> file)
         {
             string fileName, content;
             parse(file,fileName, content);
             path.push_back(pathPrefix + "/"+fileName);
             conVec.push_back(content);
         }
     }
    vector<vector<string>> findDuplicate(vector<string>& paths)
     {
         vector<string>pathVec, conVec;
         for (auto p:paths)
         {
             getFullPath(p,pathVec,conVec);
         }
         map<string, set<string>>mp2;
         for (int i = ; i < pathVec.size();i++)
         {
             mp2[conVec[i]].insert(pathVec[i]);
            // cout << pathVec[i] << " " << conVec[i] << endl;
         }
         vector<vector<string>>ret;
         for (auto it :mp2)
         {
             if (it.second.size() == )continue;
             vector<string> temp(it.second.begin(),it.second.end());
             ret.push_back(temp);
         }
         return ret;
     }

看到相同思路的人写的，但是感觉大神的要简洁的多的多。。

vector<vector<string>> findDuplicate(vector<string>& paths) {
    unordered_map<string, vector<string>> files;
    vector<vector<string>> result;

    for (auto path : paths) {
        stringstream ss(path);
        string root;
        string s;
        getline(ss, root, ' ');
        while (getline(ss, s, ' ')) {
            string fileName = root + '/' + s.substr(, s.find('('));
            string fileContent = s.substr(s.find('(') + , s.find(')') - s.find('(') - );
            files[fileContent].push_back(fileName);
        }
    }

    for (auto file : files) {
        if (file.second.size() > )
            result.push_back(file.second);
    }

    return result;
}

参考：

https://discuss.leetcode.com/topic/91430/c-clean-solution-answers-to-follow-up