leetcode/1233.cpp at main · h3902340/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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
#include "Jutil.h"
using namespace std;

#define KNRM "\x1B[0m"
#define KRED "\x1B[31m"
#define KGRN "\x1B[32m"

class Solution {
   public:
    vector<string> removeSubfolders(vector<string> &folder) {
        int n = folder.size();
        sort(folder.begin(), folder.end());
        int i = 0;
        for (int j = 1; j < n; j++) {
            if (folder[i].size() > folder[j].size()) {
                i++;
                folder[i] = folder[j];
                continue;
            }
            if (folder[i].size() == folder[j].size()) {
                bool isEqual = true;
                int len = folder[i].size();
                for (int k = 0; k < len; k++) {
                    if (folder[i][k] != folder[j][k]) {
                        isEqual = false;
                        break;
                    }
                }
                if (!isEqual) {
                    i++;
                    folder[i] = folder[j];
                }
                continue;
            }
            bool isPrefix = true;
            int len = folder[i].size();
            for (int k = 0; k < len; k++) {
                if (folder[i][k] != folder[j][k]) {
                    isPrefix = false;
                    break;
                }
            }
            if (folder[j][len] != '/') {
                isPrefix = false;
            }
            if (!isPrefix) {
                i++;
                folder[i] = folder[j];
            }
        }
        folder.resize(i + 1);
        return folder;
    }
};

int main() {
    string problemName = "1233";
    auto begin = jtimer();
    Solution sol;
    ifstream file_in("testcases/" + problemName + "_in.txt");
    ifstream file_out("testcases/" + problemName + "_out.txt");
    bool allPass = true;
    int caseCount = 0;
    int passCount = 0;
    string line_in;
    string line_out;
    while (getline(file_in, line_in)) {
        auto folder = jread_vector_string(line_in);
        auto res = sol.removeSubfolders(folder);
        getline(file_out, line_out);
        auto ans = jread_vector_string(line_out);
        printf("Case %d", ++caseCount);
        if (res == ans) {
            passCount++;
            printf(" %s(PASS)", KGRN);
        } else {
            printf(" %s(WRONG)", KRED);
            allPass = false;
        }
        printf("\n%s", KNRM);
        jprint(res, "res");
        jprint(ans, "ans");
        printf("\n");
    }
    if (allPass) {
        printf("%sALL CORRECT [%d/%d]\n%s", KGRN, passCount, caseCount, KNRM);
    } else {
        printf("%sWRONG ANSWER [%d/%d]\n%s", KRED, passCount, caseCount, KNRM);
    }
    auto end = jtimer();
    jprint_time(begin, end);
    return 0;
}