classSolution{
public:intwiggleMaxLength(vector<int>& nums){
int ret =0;int left =0;int right =0;for(int i =0; i < nums.size()-1; i++){
right = nums[i+1]- nums[i];if(right ==0)continue;if(left*right <=0) ret++;
left = right;}//第一个点是没有加入进来的!return ret+1;}};
classSolution{
public:boolincreasingTriplet(vector<int>& nums){
int one = nums[0];int two = INT_MAX;for(int cur =1; cur < nums.size(); cur++){
if(nums[cur]> two)returntrue;elseif(nums[cur]< two){
if(nums[cur]<= one) one = nums[cur];else two = nums[cur];}}returnfalse;}};
classSolution{
public:intfindLengthOfLCIS(vector<int>& nums){
int i=0;int ret =0;while(i < nums.size()){
int j =0;for(j = i;j<nums.size()-1;j++){
if(nums[j]>= nums[j+1])break;}
ret =max(ret , j-i+1);//贪心思路j的位置在连续递增子序列的最后一个位置!
i = j+1;}return ret;}};