zoukankan      html  css  js  c++  java
  • 609. Find Duplicate File in System

    Given a list paths of directory info, including the directory path, and all the files with contents in this directory, return all the duplicate files in the file system in terms of their paths. You may return the answer in any order.

    A group of duplicate files consists of at least two files that have 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 the 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 groups 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: paths = ["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"]]
    

    Example 2:

    Input: paths = ["root/a 1.txt(abcd) 2.txt(efgh)","root/c 3.txt(abcd)","root/c/d 4.txt(efgh)"]
    Output: [["root/a/2.txt","root/c/d/4.txt"],["root/a/1.txt","root/c/3.txt"]]
    

    Constraints:

    • 1 <= paths.length <= 2 * 104
    • 1 <= paths[i].length <= 3000
    • 1 <= sum(paths[i].length) <= 5 * 105
    • paths[i] consist of English letters, digits, '/''.''('')', and ' '.
    • 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. A single blank space separates the directory path and file info.

    Follow up:

    • 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?
    public static List<List<String>> findDuplicate(String[] paths) {
            Map<String, List<String>> map = new HashMap<>();
            for(String path : paths) {
                String[] tokens = path.split(" ");
                for(int i = 1; i < tokens.length; i++) {
                    String file = tokens[i].substring(0, tokens[i].indexOf('('));
                    String content = tokens[i].substring(tokens[i].indexOf('(') + 1, tokens[i].indexOf(')'));
                    map.putIfAbsent(content, new ArrayList<>());
                    map.get(content).add(tokens[0] + "/" + file);
                }
            }
            return map.values().stream().filter(e -> e.size() > 1).collect(Collectors.toList());
        }

    就喜欢这种偷鸡摸狗的解法

    https://leetcode.com/problems/find-duplicate-file-in-system/discuss/104154/Straight-forward-solution-with-a-tiny-bit-of-Java8

    public class Solution {
        public static List<List<String>> findDuplicate(String[] paths) {
                Map<String, List<String>> map = new HashMap<>();
                for(String path : paths) {
                    String[] tokens = path.split(" ");
                    for(int i = 1; i < tokens.length; i++) {
                        String file = tokens[i].substring(0, tokens[i].indexOf('('));
                        String content = tokens[i].substring(tokens[i].indexOf('(') + 1, tokens[i].indexOf(')'));
                        map.putIfAbsent(content, new ArrayList<>());
                        map.get(content).add(tokens[0] + "/" + file);
                    }
                }
                List<List<String>> res = new ArrayList();
                for (String key: map.keySet()) {
                    if (map.get(key).size() > 1)
                    res.add(map.get(key));
                }
                return res;
            }
    }
  • 相关阅读:
    Django
    MySql、Mongodb和Redis的区别
    数据库读写分离之配置Django实现数据库读写分离
    MySQL数据库优化
    01--web框架本质 wsgiref模块介绍
    CI上传图片 The filetype you are attempting to upload is not allowed.
    微信小程序 swiper和video的autoplay设置冲突问题
    关于手机端页面使用border-radius:50%不能使用div变为圆形问题
    微信小程序支付获取params的时候使用JsApiPay失败
    小程序使用笔记
  • 原文地址:https://www.cnblogs.com/wentiliangkaihua/p/14784907.html
Copyright © 2011-2022 走看看