674. Longest Continuous Increasing Subsequence(Java)
来源:互联网 发布:网络黑客头像 编辑:程序博客网 时间:2024/04/30 20:59
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.
class Solution { public int findLengthOfLCIS(int[] nums) { if (nums.length == 0 || nums == null) return 0; int count = 1, tmp = 1; for (int i = 0; i < nums.length - 1; i ++) { if (nums[i] < nums[i + 1]) { tmp ++; count = Math.max(count, tmp); } else tmp = 1; } return count; }}
优化后:
class Solution { public int findLengthOfLCIS(int[] nums) { int count = 0, tmp = 0; for(int i = 0; i < nums.length; i ++) { if (i == 0 || nums[i - 1] < nums[i]) count = Math.max(count, ++ tmp); else tmp = 1; } return count; }}
阅读全文
0 0
- 674. Longest Continuous Increasing Subsequence(Java)
- 674. Longest Continuous Increasing Subsequence
- 674. Longest Continuous Increasing Subsequence
- 674. Longest Continuous Increasing Subsequence
- 674. Longest Continuous Increasing Subsequence
- 674. Longest Continuous Increasing Subsequence
- 674. Longest Continuous Increasing Subsequence
- 674. Longest Continuous Increasing Subsequence
- Longest Continuous Increasing Subsequence
- LeetCode-Easy-Java-Longest Continuous Increasing Subsequence
- LWC 49: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
- Linux学习(十四):修改环境变量
- [agc012c]Tautonym Puzzle
- Spring基于注解的知识点1
- let var和const
- 排序算法(1):总述
- 674. Longest Continuous Increasing Subsequence(Java)
- 实验一 线性表的基本操作实现及其应用
- 关于web上文章移植伴随的样式问题
- Day03 接口 多态
- 详解数组--sort()方法原理下
- 如何通过postman生成接口测试脚本
- mybatis+springmvc时间格式化,jsp实现或者在ResponseBody日期类型Json处理
- linux 基本文件操作-----creat open write read close
- Oracle之经典查询