zoukankan      html  css  js  c++  java
  • 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.

    获取给定数组的最长递增子串长度

    解法一:

     1     public int findLengthOfLCIS(int[] nums) {
     2         int max=0,left=0;
     3         if (nums.length==0) return 0;
     4         while (left<nums.length)
     5         {
     6             int count=1;
     7             int right = left+1;
     8             while (right<nums.length && nums[left] < nums[right])
     9             {
    10                 count++;
    11                 left=right;
    12                 right++;
    13             }
    14             left=right;
    15             max = Math.max(max,count);
    16         }
    17         return max;
    18     }
  • 相关阅读:
    Thrift在微服务中的使用
    MySQL 必知必会
    IDEA 内使用 git
    分布式锁
    LeetCode 图
    LeetCode 位运算
    LeetCode 数组
    LeetCode 字符串
    LeetCode 哈希表
    LeetCode 栈和队列
  • 原文地址:https://www.cnblogs.com/wzj4858/p/7672664.html
Copyright © 2011-2022 走看看