LeetCode 1233 Remove Sub-Folders from the Filesystem (Trie)

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.

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 * 104
• 2 <= folder[i].length <= 100
• folder[i] contains only lowercase letters and '/'.
• folder[i] always starts with the character '/'.
• Each folder name is unique.

题目链接：https://leetcode.com/problems/remove-sub-folders-from-the-filesystem/

题目大意：删除所有的子目录

题目分析：用folder字符串建trie，注意查询时查到一个folder后要继续遍历26个小写字母，不用遍历"/"，防止样例3的情况漏掉 

82ms，时间击败57.70%

class Solution {
    
    class TrieNode {
        boolean end;
        TrieNode[] nxt;
        String folder;
        TrieNode() {
            this.end = false;
            this.nxt = new TrieNode[27];
            this.folder = "";
        }
    }
    
    class Trie {
        TrieNode root;
        List<String> ans;
        Trie() {
            this.root = new TrieNode();
            ans = new ArrayList<>();
        }
        
        void insert(String s) {
            TrieNode p = root;
            for (int i = 0; i < s.length(); i++) {
                int idx = 26;
                if (s.charAt(i) != '/') {
                    idx = s.charAt(i) - 'a';
                }
                if (p.nxt[idx] == null) {
                    p.nxt[idx] = new TrieNode();
                }
                p = p.nxt[idx];
            }
            p.end = true;
            p.folder = s;
        }
        
        List<String> solve() {
            List<String> ans = new ArrayList<>();
            dfs(root, ans);
            return ans;
        }
        
        private void dfs(TrieNode cur, List<String> ans) {
            if (cur.end) {
                ans.add(cur.folder);
                for (int i = 0; i < 26; i++) {
                    if (cur.nxt[i] != null) {
                        dfs(cur.nxt[i], ans);
                    }
                }
                return;
            }
            for (int i = 0; i < 27; i++) {
                if (cur.nxt[i] != null) {
                    dfs(cur.nxt[i], ans);
                }
            }
        }
    }
    
    public List<String> removeSubfolders(String[] folder) {
        Trie trie = new Trie();
        for (String f : folder) {
            trie.insert(f);
        }
        return trie.solve();
    }
}