http://bookshadow.com/weblog/2017/05/21/leetcode-design-in-memory-file-system/
https://discuss.leetcode.com/topic/90016/file-system-as-a-tree-java
X. https://discuss.leetcode.com/topic/90000/java-solution-file-class
https://discuss.leetcode.com/topic/90004/file-system-as-graph
Design an in-memory file system to simulate the following functions:
ls: Given a path in string format. If it is a file path, return a list that only contains this file's name. If it is a directory path, return the list of file and directory names in this directory. Your output (file and directory names together) should in lexicographic order.mkdir: Given a directory path that does not exist, you should make a new directory according to the path. If the middle directories in the path don't exist either, you should create them as well. This function has void return type.addContentToFile: Given a file path and file content in string format. If the file doesn't exist, you need to create that file containing given content. If the file already exists, you need to append given content to original content. This function has void return type.readContentFromFile: Given a file path, return its content in string format.
Example:
Note:
- You can assume all file or directory paths are absolute paths which begin with
/and do not end with/except that the path is just"/". - You can assume that all operations will be passed valid parameters and users will not attempt to retrieve file content or list a directory or file that does not exist.
- You can assume that all directory names and file names only contain lower-case letters, and same names won't exist in the same directory.
题目大意：
设计内存文件系统模拟实现如下功能：
ls：给定路径字符串，若对应一个目录，则输出其中包含的目录和文件（字典序）；若对应一个文件，则只输出该文件名
mkdir：创建目录，若目录不存在，则递归创建缺少的目录
addContentToFile：在文件中追加内容，若文件不存在，则新建
readContentFromFile：从文件中读取内容并返回
注意：
- 你可以假设文件和目录的路径均为绝对路径，以/开始，并且结尾不包含/，除非路径就是"/"本身
- 你可以假设所有操作均合法，用户不会常识读取一个不存在的文件，或者ls一个不存在的目录
- 你可以假设所有目录名称和文件名称都只包含小写字母，并且在同一目录下不会存在同名的目录或者文件
目录节点Node包含两个字段dirs和files，分别存储其中包含的子目录节点和文件内容
X. Use TreeMap to contain children nodes - so they are sorted.https://discuss.leetcode.com/topic/90016/file-system-as-a-tree-java
private class TreeNode implements Comparable<TreeNode> {
String label;
boolean isDir;
Map<String, TreeNode> dirContents = new TreeMap<>();
String fileContents;
public int compareTo(TreeNode other) {
return label.compareTo(other.label);
}
public int hashCode() {
return Objects.hash(label);
}
public boolean equals(Object treeNode) {
TreeNode other = (TreeNode) treeNode;
return Objects.equals(label, other.label);
}
}
private TreeNode sentinel = new TreeNode();
public FileSystem() {
TreeNode root = new TreeNode();
root.label = "";
root.isDir = true;
sentinel.dirContents.put("", root);
}
public List<String> ls(String path) {
String[] labels = path.split("/");
TreeNode curr = (labels.length != 0) ? sentinel : sentinel.dirContents.get("");
List<String> result = new ArrayList<>();
for(String label : labels) {
curr = curr.dirContents.get(label);
System.out.println(">>" + curr);
}
if(curr.isDir) {
for(String label : curr.dirContents.keySet()) {
result.add(label);
}
}
else {
result.add(curr.label);
}
return result;
}
public void mkdir(String path) {
String[] labels = path.split("/");
TreeNode curr = sentinel;
int currIndex = 0;
for(String label : labels) {
TreeNode next = curr.dirContents.get(label);
if(next == null) {
break;
}
currIndex++;
curr = next;
}
for(int i = currIndex; i < labels.length; i++) {
TreeNode newDir = new TreeNode();
newDir.isDir = true;
newDir.label = labels[i];
curr.dirContents.put(labels[i], newDir);
curr = newDir;
}
}
public void addContentToFile(String filePath, String content) {
String[] labels = filePath.split("/");
TreeNode curr = sentinel, prev = null;
for(String label : labels) {
prev = curr;
if(curr == null) {
break;
}
curr = curr.dirContents.get(label);
}
if(curr == null) {
curr = new TreeNode();
curr.isDir = false;
curr.label = labels[labels.length - 1];
curr.fileContents = content;
prev.dirContents.put(curr.label, curr);
}
else {
curr.fileContents = curr.fileContents == null ? content : curr.fileContents + content;
}
}
public String readContentFromFile(String filePath) {
String[] labels = filePath.split("/");
TreeNode curr = sentinel;
for(String label : labels) {
curr = curr.dirContents.get(label);
}
return (curr.fileContents == null) ? "" : curr.fileContents;
}X. https://discuss.leetcode.com/topic/90000/java-solution-file-class
https://discuss.leetcode.com/topic/90004/file-system-as-graph
class File {
boolean isFile = false;
Map<String, File> children = new HashMap<>();
String content = "";
}
File root = null;
public FileSystem() {
root = new File();
}
public List<String> ls(String path) {
String[] dirs = path.split("/");
File node = root;
List<String> result = new ArrayList<>();
String name = "";
for (String dir : dirs) {
if (dir.length() == 0) continue;
if (!node.children.containsKey(dir)) {
return result;
}
node = node.children.get(dir);
name = dir;
}
if (node.isFile) {
result.add(name);
}
else {
for (String key : node.children.keySet()) {
result.add(key);
}
}
Collections.sort(result);
return result;
}
public void mkdir(String path) {
String[] dirs = path.split("/");
File node = root;
for (String dir : dirs) {
if (dir.length() == 0) continue;
if (!node.children.containsKey(dir)) {
File file = new File();
node.children.put(dir, file);
}
node = node.children.get(dir);
}
}
public void addContentToFile(String filePath, String content) {
String[] dirs = filePath.split("/");
File node = root;
for (String dir : dirs) {
if (dir.length() == 0) continue;
if (!node.children.containsKey(dir)) {
File file = new File();
node.children.put(dir, file);
}
node = node.children.get(dir);
}
node.isFile = true;
node.content += content;
}
public String readContentFromFile(String filePath) {
String[] dirs = filePath.split("/");
File node = root;
for (String dir : dirs) {
if (dir.length() == 0) continue;
if (!node.children.containsKey(dir)) {
File file = new File();
node.children.put(dir, file);
}
node = node.children.get(dir);
}
return node.content;
}