LeetCode 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.

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

题目标签：Array

　　题目给了一个没有排序的nums array，让我们找到其中最长连续递增序列的长度。

　　维护一个maxLen，每次遇到递增数字就tempLen++，遇到一个不是递增数字的话，就把tempLen 和maxLen 中大的保存到maxLen。

Java Solution:

Runtime beats 69.72%

完成日期：10/21/2017

关键词：Array

关键点：维护一个maxLen

 class Solution

 {

     public int findLengthOfLCIS(int[] nums)

     {

         if(nums == null || nums.length == 0)

             return 0;

         int maxLen = 0;

         int tempLen = 1;

         for(int i=1; i<nums.length; i++)

         {

             if(nums[i] <= nums[i-1])

             {

                 maxLen = Math.max(maxLen, tempLen);

                 tempLen = 1;

             }

             else

             {

                 tempLen++;

             }

         }

         return Math.max(maxLen, tempLen);

     }

 }

参考资料：N/A

LeetCode 题目列表 - LeetCode Questions List

巴特西

LeetCode 674. Longest Continuous Increasing Subsequence （最长连续递增序列）

最新文章

热门文章