leetcode/daily23.cpp at main · iFangg/leetcode · GitHub

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
// Solution 1
class Solution {
public:
    int minOperations(vector<string>& logs) {
        auto folders = std::stack<std::string>{};
        for (auto move : logs) {
            if (move == "../") {
                if (!folders.empty())
                    folders.pop();
                continue;
            }

            if (move == "./")
                continue;

            folders.push(move);
        }

        return folders.size();
    }
};


// Solution 2
class Solution {
public:
    int minOperations(vector<string>& logs) {
        int n = 0;
        for (int i = 0; i < logs.size(); i++) {
            if (logs[i] == "../") {
               if(n > 0) n--;
               continue;
            }

            if (logs[i] == "./")
                continue;

            n++;
        }

        if(n < 0)
            return 0;
        return n;
    }
};