LeetCode-Solutions/C++/smallest-stable-index-i.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
// Time:  O(n)
// Space: O(n)

// prefix sum
class Solution {
public:
    int firstStableIndex(vector<int>& nums, int k) {
        vector<int> right(size(nums) + 1, numeric_limits<int>::max());
        for (int i = size(nums) - 1; i >= 0; --i) {
            right[i] = min(right[i + 1], nums[i]);
        }
        int left = 0;
        for (int i = 0; i < size(nums); ++i) {
            left = max(left, nums[i]);
            if (left - right[i] <= k) {
                return i;
            }
        }
        return -1;
    }
};

// Time:  O(n)
// Space: O(n)
// prefix sum
class Solution2 {
public:
    int firstStableIndex(vector<int>& nums, int k) {
        vector<int> left(size(nums) + 1);
        for (int i = 0; i < size(nums); ++i) {
            left[i + 1] = max(left[i], nums[i]);
        }
        vector<int> right(size(nums) + 1, numeric_limits<int>::max());
        for (int i = size(nums) - 1; i >= 0; --i) {
            right[i] = min(right[i + 1], nums[i]);
        }
        for (int i = 0; i < size(nums); ++i) {
            if (left[i + 1] - right[i] <= k) {
                return i;
            }
        }
        return -1;
    }
};