leetcode-334 Increasing Triplet Subsequence 解题记录

 1 class Solution {  
 2 public:  
 3     bool increasingTriplet(vector<int>& nums) {  
 4         if (nums.size() == 1 || nums.size() == 2 || nums.size() == 0)  
 5         {  
 6             return false;  
 7         }  
 8           
 9         int most_min = INT_MAX;  
10         int second_min = INT_MAX;  
11           
12         for (int i = 0; i < nums.size(); ++i)  
13         {  
14             if (nums[i] <= most_min)  
15             {  
16                 most_min = nums[i];  
17             }  
18             else if (nums[i] <= second_min)  
19             {  
20                 second_min = nums[i];  
21             }  
22             else  
23             {  
24                 return true;  
25             }  
26         }  
27           
28         return false;  
29       
30        
31     }  
32 };