-
-
Notifications
You must be signed in to change notification settings - Fork 608
/
Copy pathFileSystem.java
67 lines (51 loc) · 1.25 KB
/
FileSystem.java
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
package problems.easy;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
/**
* Created by sherxon on 5/20/17.
*/
public class FileSystem {
Node root;
public FileSystem() {
root = new Node("");
}
public List<String> ls(String path) {
List<String> list = new ArrayList<>();
ls(path.split("/"), 0, list, root);
return list;
}
private void ls(String[] path, int i, List<String> list, Node root) {
if (root == null) {
return;
}
if (i == path.length - 1) {
list.addAll(root.children.keySet());
return;
}
ls(path, i + 1, list, root.children.get(path[i + 1]));
}
public void mkdir(String path) {
mkdir(path.split("/"), root, 1);
}
private void mkdir(String[] split, Node root, int i) {
if (i == split.length - 1) {
return;
}
if (!root.children.containsKey(split[i])) {
root.children.put(split[i], new Node(split[i]));
}
mkdir(split, root.children.get(split[i]), i + 1);
}
public void addContentToFile(String filePath, String content) {
}
private class Node {
String name;
Map<String, Node> children = new HashMap<>();
String content;
public Node(String n) {
this.name = n;
}
}
}