lc334-Increasing Triplet Subsequence 發表於 2016-08-28 | 分類於 leetcode | 0 comments | 12345678910111213class Solution {public: bool increasingTriplet(vector<int>& nums) { int min = INT_MAX; int second_min = INT_MAX; for (int i = 0; i < nums.size(); i++) { if (nums[i] > second_min) return true; else if (nums[i] <= min) min = nums[i]; else second_min = nums[i]; } return false; }};