added problem 609

Author: SHA65536

problems/problem0609/file_dupes.go

@@ -0,0 +1,37 @@
+package problem0609
+
+import (
+	"strings"
+)
+
+/*
+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"
+*/
+
+func findDuplicate(paths []string) [][]string {
+	var result = make([][]string, 0)
+	var contentMap = map[string][]string{}
+	for _, path := range paths {
+		split := strings.Split(path, " ")
+		for _, file := range split[1:] {
+			content_sep := strings.Index(file, "(")
+			name := file[:content_sep]
+			content := file[content_sep+1 : len(file)-1]
+			contentMap[content] = append(contentMap[content], split[0]+"/"+name)
+		}
+	}
+	for k := range contentMap {
+		if len(contentMap[k]) > 1 {
+			result = append(result, contentMap[k])
+		}
+	}
+	return result
+}

problems/problem0609/file_dupes_test.go

@@ -0,0 +1,30 @@
+package problem0609
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+type Result struct {
+	Input    []string
+	Expected [][]string
+}
+
+var Results = []Result{
+	{[]string{"root/a 1.txt(abcd) 2.txt(efgh)", "root/c 3.txt(abcd)", "root/c/d 4.txt(efgh)", "root 4.txt(efgh)"},
+		[][]string{{"root/a/1.txt", "root/c/3.txt"}, {"root/a/2.txt", "root/c/d/4.txt", "root/4.txt"}}},
+	{[]string{"root/a 1.txt(abcd) 2.txt(efgh)", "root/c 3.txt(abcd)", "root/c/d 4.txt(efgh)"},
+		[][]string{{"root/a/1.txt", "root/c/3.txt"}, {"root/a/2.txt", "root/c/d/4.txt"}}},
+}
+
+func TestFileDuplicates(t *testing.T) {
+	assert := assert.New(t)
+
+	for _, res := range Results {
+		want := res.Expected
+		got := findDuplicate(res.Input)
+		assert.Equal(want, got, fmt.Sprintf("%+v", res))
+	}
+}

readme.md

@@ -112,6 +112,7 @@ Each problem is in it's own directory, with test files. There are helper package
 | 0576 | [Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths) | [My Solution](./problems/problem0576) | ✅ |
 | 0583 | [Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings) | [My Solution](./problems/problem0583) | ✅ |
 | 0606 | [Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree) | [My Solution](./problems/problem0606) | ✅ |
+| 0609 | [Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system) | [My Solution](./problems/problem0609) | ✅ |
 | 0617 | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees) | [My Solution](./problems/problem00617) | ✅ |
 | 0630 | [Course Schedule III](https://leetcode.com/problems/course-schedule-iii) | [My Solution](./problems/problem0630) | ✅ |
 | 0637 | [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree) | [My Solution](./problems/problem0637) | ✅ |