588. Design In-Memory File System

• Difficulty: Hard

• Topics: Design

• Similar Questions:

  • LRU Cache

  • LFU Cache

  • Design Log Storage System

Problem:

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:

Input: 
["FileSystem","ls","mkdir","addContentToFile","ls","readContentFromFile"]
[[],["/"],["/a/b/c"],["/a/b/c/d","hello"],["/"],["/a/b/c/d"]]

Output:
[null,[],null,null,["a"],"hello"]

Explanation:

Note:

1. 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 "/".
2. 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.
3. 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.

Solutions:

class FileSystem {
public:
    FileSystem() {
        root = new Directory("");
    }

    vector<string> ls(string path) {
        vector<string> tokens = tokenize(path);
        Node* cur = root;
        for (auto& token : tokens) {
            cur = cur->next[token];
        }

        return cur->ls();
    }

    void mkdir(string path) {
        vector<string> tokens = tokenize(path);
        Node* cur = root;
        for (auto& token : tokens) {
            if (cur->next.count(token) == 0) {
                cur->next[token] = new Directory(token);
            }
            cur = cur->next[token];
        }
    }

    void addContentToFile(string filePath, string content) {
        vector<string> tokens = tokenize(filePath);
        Node* cur = root;
        for (auto& token : tokens) {
            if (cur->next.count(token) == 0) {
                cur->next[token] = new File(token);
            }
            cur = cur->next[token];
        }

        ((File*) cur)->append(content);
    }

    string readContentFromFile(string filePath) {
        vector<string> tokens = tokenize(filePath);
        Node* cur = root;
        for (auto& token : tokens) {
            cur = cur->next[token];
        }

        return ((File*) cur)->read();
    }

private:
    class Node {
    public:
        Node(const string& name) {
            this->name = name;
        }

        string getName() {
            return name;
        }

        virtual bool isDirectory() = 0;
        virtual vector<string> ls() = 0; 

        map<string, Node*> next;
    protected:
        string name;
    };

    class File : public Node {
    public:
        File(const string& name): Node(name) {}

        bool isDirectory() override{
            return false;
        }

        vector<string> ls() override {
            return {name};
        }

        void append(const string& str) {
            data.append(str);
        }

        string read() {
            return data;
        }
    private:
        string data;
    };

    class Directory : public Node {
    public:
        Directory(const string& name): Node(name) {}

        bool isDirectory() override {
            return true;
        }

        vector<string> ls() override {
            vector<string> ret;
            for (auto it = next.begin(); it != next.end(); ++it) {
                ret.push_back(it->first);
            }

            return ret;
        }
    private:

    };

    vector<string> tokenize(const string& path) {
        vector<string> ret;
        int pos = 1;
        string token;
        while (pos < path.length()) {
            if (path[pos] == '/') {
                ret.push_back(token);
                token.clear();
            } else {
                token.push_back(path[pos]);
            }
            ++pos;
        }

        if (token.length() > 0) {
            ret.push_back(token);
        }

        return ret;
    }

    Node* root;
};

/**
 * Your FileSystem object will be instantiated and called as such:
 * FileSystem* obj = new FileSystem();
 * vector<string> param_1 = obj->ls(path);
 * obj->mkdir(path);
 * obj->addContentToFile(filePath,content);
 * string param_4 = obj->readContentFromFile(filePath);
 */