LeetCode-Easy-Java-Longest Continuous Increasing Subsequence
来源:互联网 发布:知乎自媒体入住 编辑:程序博客网 时间:2024/05/21 12:17
找到一个数组中连续增长的最大长度
题目描述:
Given an unsorted array of integers, find the length of longest continuous
increasing subsequence.
Example 1:
Input: [1,3,5,4,7]Output: 3Explanation: 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: 1Explanation: The longest continuous increasing subsequence is [2], its length is 1.
Note: Length of the array will not exceed 10,000.
解决思路:
!!!首先一定要先判断是否为空,空则返回0;
然后从第一位循环判断是否当前数比下一个数小,如果小则长度+1;
如果大于或等于则重置长度值,重新计算;(!!!等于也不属于递增情况)
结果值最终取得最大的长度值。
class Solution { public int findLengthOfLCIS(int[] nums) { if(nums.length==0){ return 0; } int result=1; int len=1; for(int i=0;i<nums.length-1;i++){ if(nums[i]<nums[i+1]){ len=len+1; }else{ len=1; } if(result<len){ result=len; } } return result; }}
更多算法知识点 关注FunctionY csdn博客哦!
阅读全文
1 0
- LeetCode-Easy-Java-Longest Continuous Increasing Subsequence
- leetcode 674[easy]--- Longest Continuous Increasing Subsequence
- leetCode-Longest Continuous Increasing Subsequence
- LeetCode 674. Longest Continuous Increasing Subsequence
- leetcode 674. Longest Continuous Increasing Subsequence
- leetcode 674. Longest Continuous Increasing Subsequence
- Leetcode 674 Longest Continuous Increasing Subsequence
- LeetCode 674. Longest Continuous Increasing Subsequence
- leetcode 674 Longest Continuous Increasing Subsequence
- LeetCode 674. Longest Continuous Increasing Subsequence
- LeetCode 674.Longest Continuous Increasing Subsequence
- LeetCode-674. Longest Continuous Increasing Subsequence
- Longest Continuous Increasing Subsequence
- 674. Longest Continuous Increasing Subsequence(Java)
- [Lintcode]Longest Increasing Continuous Subsequence
- #397 Longest Increasing Continuous Subsequence
- 674. Longest Continuous Increasing Subsequence
- 674. Longest Continuous Increasing Subsequence
- 三角形的外接圆
- 函数作为参数的使用
- java 快速获取当前日期,昨天日期,明天日期
- HDFS Ozone的Pipeline实现机制
- C++中 #ifdef 和#endif的作用
- LeetCode-Easy-Java-Longest Continuous Increasing Subsequence
- 深度学习——NIN
- mysql数据库mysql: [ERROR] unknown option '--skip-grant-tables'
- 大数据集群搭建之节点的网络配置过程(二)
- jquery ajax报Uncaught TypeError :Illegal invocation
- 洛谷 P2261 [CQOI2007]余数求和
- web项目的分层思想
- 决策树(DecisionTree)的白话原理和简单应用
- Android之xxx is not a concrete class解决办法