leetcode/1234.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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
#include <vector>

#include "Jutil.h"
using namespace std;

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

const int C = 4;
int fre[C];
class Solution {
   public:
    int balancedString(string s) {
        int n = s.size();
        int t = n >> 2;
        for (int i = 0; i < C; i++) {
            fre[i] = 0;
        }
        for (int i = 0; i < n; i++) {
            switch (s[i]) {
                case 'Q':
                    fre[0]++;
                    break;
                case 'W':
                    fre[1]++;
                    break;
                case 'E':
                    fre[2]++;
                    break;
                case 'R':
                    fre[3]++;
                    break;
            }
        }
        bool isOK = check(t);
        if (isOK) return 0;
        int res = n;
        int i = 0;
        for (int j = 0; j < n; j++) {
            switch (s[j]) {
                case 'Q':
                    fre[0]--;
                    break;
                case 'W':
                    fre[1]--;
                    break;
                case 'E':
                    fre[2]--;
                    break;
                case 'R':
                    fre[3]--;
                    break;
            }
            while (check(t)) {
                int len = j - i + 1;
                if (res > len) {
                    res = len;
                }
                switch (s[i]) {
                    case 'Q':
                        fre[0]++;
                        break;
                    case 'W':
                        fre[1]++;
                        break;
                    case 'E':
                        fre[2]++;
                        break;
                    case 'R':
                        fre[3]++;
                        break;
                }
                i++;
            }
        }
        return res;
    }
    bool check(int t) {
        bool isOK = true;
        for (int k = 0; k < 4; k++) {
            if (fre[k] > t) {
                isOK = false;
                break;
            }
        }
        return isOK;
    }
};

int main() {
    string problemName = "1234";
    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 s = jread_string(line_in);
        auto res = sol.balancedString(s);
        getline(file_out, line_out);
        auto ans = jread_int(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;
}