LeetCode/main.cpp at master · qibolee/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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
#include "heads/head.h"
#include "heads/No220_Contains Duplicate III.h"
#include "String.h"
#include <fstream>
#include "Kara.h"
#include "KMP.h"


using namespace std;


class A {
public:
    A(int i) {
        cout << "A(int)" << endl;
    }

private:
    typedef enum {
        a,
        b,
        c
    } Types;
};

class B : public A {
public:
    B() : A(3) {
        cout << "B()" << endl;
    }
};

struct Comp {
    bool operator()(const pair<int, int> &par1, const pair<int, int> &par2) {
        return par1.first < par2.first;
    }
};


string Encode(string in) {

    string ret;
    ret.reserve(32);
    int num = stoi(in);
    while (num != 0) {
        if (num % 2 == 1) {
            ret.push_back('1');
        } else {
            ret.push_back('0');
        }
        num /= 2;
    }
    reverse(ret.begin(), ret.end());
    return ret;

}

string Decode(string in) {

    int ret = 0;
    for (char ch:in) {
        ret *= 16;
        if (ch >= '0' && ch <= '9') {
            ret += ch - '0';
        } else if (ch >= 'A' && ch <= 'F') {
            ret += ch - 'A';
        } else {
            return "false";
        }
    }

    return to_string(ret);

}

void q_sort(int *nums, int n) {
    if (n == 0 || n == 1) {
        return;
    }
    int tmp = nums[0];
    int p1 = 0, p2 = n - 1;
    bool fill_front = true;
    while (p1 < p2) {
        if (fill_front) {
            if (nums[p2] < tmp) {
                nums[p1] = nums[p2];
                ++p1;
                fill_front = false;
            } else {
                --p2;
            }
        } else {
            if (nums[p1] > tmp) {
                nums[p2] = nums[p1];
                --p2;
                fill_front = true;
            } else {
                ++p1;
            }
        }
    }
    nums[p1] = tmp;
    q_sort(nums, p1);
    q_sort(nums + p1 + 1, n - p1 - 1);

}

struct PairHash {
    int operator()(const pair<int, int> &par) const {
        return par.first ^ par.second;
    }
};

bool is_shui(int n) {
    int tmp = n;
    int sum = 0;
    while (tmp > 0) {
        sum += (tmp % 10) * (tmp % 10) * (tmp % 10);
        tmp /= 10;
    }
    return sum == n;
}

int main() {

    clock_t start, finish;
    start = clock();
/**
 * your code
 */


/**
 * end
 */
    finish = clock();
    cout << "\nrun finished in " << 1.0 * (finish - start) / CLOCKS_PER_SEC << " (s)" << endl;

    return 0;
}