LeetCode-Solutions/C++/valid-elements-in-an-array.cpp at master · kamyu104/LeetCode-Solutions · 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
// Time:  O(n)
// Space: O(n)

// prefix sum
class Solution {
public:
    vector<int> findValidElements(vector<int>& nums) {
        vector<bool> right(size(nums));
        int mx = 0;
        for (int i = size(nums) - 1; i >= 0; --i) {
            right[i] = nums[i] > mx;
            mx = max(mx, nums[i]);
        }
        vector<int> result;
        bool left = false;
        mx = 0;
        for (int i = 0; i < size(nums); ++i) {
            left = nums[i] > mx;
            mx = max(mx, nums[i]);
            if (left || right[i]) {
                result.emplace_back(nums[i]);
            }
        }
        return result;
    }
};

// Time:  O(n)
// Space: O(n)
// prefix sum
class Solution2 {
public:
    vector<int> findValidElements(vector<int>& nums) {
        vector<bool> left(size(nums));
        int mx = 0;
        for (int i = 0; i < size(nums); ++i) {
            left[i] = nums[i] > mx;
            mx = max(mx, nums[i]);
        }
        vector<bool> right(size(nums));
        mx = 0;
        for (int i = size(nums) - 1; i >= 0; --i) {
            right[i] = nums[i] > mx;
            mx = max(mx, nums[i]);
        }
        vector<int> result;
        for (int i = 0; i < size(nums); ++i) {
            if (left[i] || right[i]) {
                result.emplace_back(nums[i]);
            }
        }
        return result;
    }
};