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

    思路:如果数组的长度小于2,则直接返回数组的长度;否则设置两个变量maxLength=1和length=1,length用于统计

    连续递增的子序列长度,一旦递增中断,则lenth重置为1,继续后面的统计。这个过程中,最大的length值赋给maxLength

     1 class Solution {
     2     public int findLengthOfLCIS(int[] nums) {
     3         if (nums.length<2)
     4             return nums.length;
     5         int maxLength = 1,length = 1;
     6         for (int i=1;i<nums.length;i++){
     7             if (nums[i]>nums[i-1])
     8                 length++;
     9             else 
    10                 length = 1;
    11             if (length>maxLength)
    12                 maxLength = length;
    13         }
    14         return maxLength;
    15     }
    16 }
  • 相关阅读:
    linux Mysql 安装
    百度地图的一些操作
    Angularjs Table
    liunx安装mongodb
    ARP协议
    Python获取IP的方式与意义
    selenium 的使用--持续更
    使用pyquery
    beautiful soup的用法
    内置函数
  • 原文地址:https://www.cnblogs.com/David-Lin/p/7743819.html
Copyright © 2011-2022 走看看