LeetCode_Archiver/LeetCode/cpp/1006.cpp at master · chr1sc2y/LeetCode_Archiver · 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
class Solution {
public:
    int clumsy(int N) {
        vector<int> nums;
        if (N >= 4) {
            nums.push_back(N * (N - 1) / (N - 2) + (N - 3));
            N -= 4;
        }
        while (N >= 4) {
            nums.push_back(N * (N - 1) / (N - 2) - (N - 3));
            N -= 4;
        }
        int temp = 0;
        if (N > 0) {
            temp = N;
            --N;
            if (N > 0) {
                temp *= N;
                --N;
                if (N > 0) {
                    temp /= N;
                    --N;
                }
            }
        }
        if (nums.empty())
            return temp;
        int res = nums[0];
        int i = 1;
        while (i < nums.size()) {
            res -= nums[i];
            ++i;
        }
        return res - temp;
    }
};