add Hao's implementation

This commit is contained in:
Hao Chen 2019-03-21 18:44:40 +08:00
parent f936bde1b5
commit dc173fe6bb

View File

@ -1,5 +1,5 @@
// Source : https://leetcode.com/problems/increasing-triplet-subsequence/
// Author : Calinescu Valentin
// Author : Calinescu Valentin, Hao Chen
// Date : 2016-02-27
/***************************************************************************************
@ -41,3 +41,25 @@ public:
return solution;
}
};
//Hao Chen's implementation
class Solution {
public:
bool increasingTriplet(vector<int>& nums) {
if (nums.size() < 3) return false;
int first=INT_MAX, second = INT_MAX;
for(int i=0; i<nums.size(); i++) {
if ( first > nums[i] ) {
first = nums[i];
}else if ( first < nums[i] && nums[i] < second) {
second = nums[i];
}else if (nums[i] > second){
return true;
}
}
return false;
}
};