leetCodePractice/LeetCode/LeetCode/algorithms_cplusplus/q0229.hpp at master · im-ling/leetCodePractice · 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
//
//  q0229.hpp
//  LeetCode
//
//  Created by 李凌 on 2020/10/10.
//  Copyright © 2020 DoubleL. All rights reserved.
//

#ifndef q0229_hpp
#define q0229_hpp

#include <iostream>
#include <queue>
#include <algorithm>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <numeric>
#include <stack>
#include <string>

using namespace std;
void question0229(){
    class Solution {
    public:
        vector<int> majorityElement(vector<int>& nums) {
            int number1 = 0;
            int number2 = 0;
            int count1 = 0;
            int count2 = 0;
            for (auto number : nums) {
                if (number == number1) {
                    count1++;
                }else if (number == number2) {
                    count2++;
                }else if (!count1){
                    number1 = number;
                    count1++;
                }else if (!count2){
                    number2 = number;
                    count2++;
                }else{
                    count1--;
                    count2--;
                }
            }

            count1 = 0;
            count2 = 0;
            for (auto number : nums) {
                if (number == number1) {
                    count1++;
                }
                if (number == number2) {
                    count2++;
                }
            }
            vector<int> result;
            if (count1 > nums.size() / 3.0) {
                result.push_back(number1);
            }
            if (number2 != number1 && count2 > nums.size() / 3.0) {
                result.push_back(number2);
            }
            return result;
        }
    };
}

#endif /* q0229_hpp */