[leetcode-674-Longest Continuous Increasing Subsequence]

标签：array   exp   where   sub   i++   ati   input   遍历   length   

Given an unsorted array of integers, find the length of longest continuous increasing subsequence.

Example 1:

Input: [1,3,5,4,7]
Output: 3
Explanation: The longest continuous increasing subsequence is [1,3,5], its length is 3. 
Even though [1,3,5,7] is also an increasing subsequence, it‘s not a continuous one where 5 and 7 are separated by 4. 

Example 2:

Input: [2,2,2,2,2]
Output: 1
Explanation: The longest continuous increasing subsequence is [2], its length is 1. 

Note: Length of the array will not exceed 10,000.

思路：

遍历即可。水题。

int findLengthOfLCIS(vector<int>& nums) 
{
  int n =nums.size();
  if(n <= 1)return n;
  int ret = 1,length=1;
  for(int i=1;i<n;i++)
  {
    if(nums[i]>nums[i-1])length++;
    else length =1;
    ret = max(length,ret);
  }
  return ret;
}

[leetcode-674-Longest Continuous Increasing Subsequence]

标签：array   exp   where   sub   i++   ati   input   遍历   length   

原文地址：http://www.cnblogs.com/hellowooorld/p/7500576.html