-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.go
More file actions
74 lines (66 loc) · 2.4 KB
/
main.go
File metadata and controls
74 lines (66 loc) · 2.4 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
// Source: https://leetcode.com/problems/remove-sub-folders-from-the-filesystem
// Title: Remove Sub-Folders from the Filesystem
// Difficulty: Medium
// Author: Mu Yang <http://muyang.pro>
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// Given a list of folders `folder`, return the folders after removing all **sub-folders** in those folders. You may return the answer in **any order**.
//
// If a `folder[i]` is located within another `folder[j]`, it is called a **sub-folder** of it. A sub-folder of `folder[j]` must start with `folder[j]`, followed by a `"/"`. For example, `"/a/b"` is a sub-folder of `"/a"`, but `"/b"` is not a sub-folder of `"/a/b/c"`.
//
// The format of a path is one or more concatenated strings of the form: `'/'` followed by one or more lowercase English letters.
//
// - For example, `"/leetcode"` and `"/leetcode/problems"` are valid paths while an empty string and `"/"` are not.
//
// **Example 1:**
//
// ```
// Input: folder = ["/a","/a/b","/c/d","/c/d/e","/c/f"]
// Output: ["/a","/c/d","/c/f"]
// Explanation: Folders "/a/b" is a subfolder of "/a" and "/c/d/e" is inside of folder "/c/d" in our filesystem.
// ```
//
// **Example 2:**
//
// ```
// Input: folder = ["/a","/a/b/c","/a/b/d"]
// Output: ["/a"]
// Explanation: Folders "/a/b/c" and "/a/b/d" will be removed because they are subfolders of "/a".
// ```
//
// **Example 3:**
//
// ```
// Input: folder = ["/a/b/c","/a/b/ca","/a/b/d"]
// Output: ["/a/b/c","/a/b/ca","/a/b/d"]
// ```
//
// **Constraints:**
//
// - `1 <= folder.length <= 4 * 10^4`
// - `2 <= folder[i].length <= 100`
// - `folder[i]` contains only lowercase letters and `'/'`.
// - `folder[i]` always starts with the character `'/'`.
// - Each folder name is **unique**.
//
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
package main
import (
"slices"
"strings"
)
// Sort the folders lexicographically.
// Note that the folders is a forest after sorting.
// Compare the folder with the last know parent to check if it is a subfolder.
func removeSubfolders(folders []string) []string {
n := len(folders)
slices.Sort(folders)
ans := make([]string, 0, n)
prefix := "!"
for _, folder := range folders {
if !strings.HasPrefix(folder, prefix) {
ans = append(ans, folder)
prefix = folder + "/"
}
}
return ans
}