674. Longest Continuous Increasing Subsequence

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. 

在未排序的数组中，找出最长递增序列的长度

 

c++(16ms):

 1 class Solution {
 2 public:
 3     int findLengthOfLCIS(vector<int>& nums) {
 4                 int len  = nums.size() ;
 5         if (len < 1)
 6             return 0 ;
 7         int Max = 1 ;
 8         int n = 1 ;
 9         for (int i = 0 ; i < len-1 ; i++){
10             if (nums[i] < nums[i+1])
11                 n++ ;
12             else
13                 n = 1 ;
14             if (n > Max)
15                 Max = n ;
16         }
17         return Max ;
18     }
19 };

 

转载于:https://www.cnblogs.com/mengchunchen/p/7531542.html