Increasing Triplet Subsequence LeetCode solution in C++

1
class Solution {
2
 public:
3
  bool increasingTriplet(vector<int> &nums) {
4
    int n = nums.size();
5
    int smallest = INT_MAX;
6
    int second_smallest = INT_MAX;
7
    for (int i = 0; i < n; i++) {
8
      if (nums[i] <= smallest) {
9
        smallest = nums[i];
10
      } else if (nums[i] <= second_smallest) {
11
        second_smallest = nums[i];
12
      } else {
13
        return true;
14
      }
15
    }
16

17
    return false;
18
  }
19
};