[leetCode刷题笔记]300. Longest Increasing Subsequence
来源:互联网 发布:书生商友软件 编辑:程序博客网 时间:2024/06/07 20:34
DP解决,用dp[len]表示遍历到的最大值,新的值如果大于这个值len++否则替换dp中的一个len不变
public class Solution { public int lengthOfLIS(int[] nums) { //use dp[len] to store the largest val. int[] dp = new int[nums.length]; int len = 0; for (int k : nums) { int i = Arrays.binarySearch(dp, 0, len, k); if (i < 0) i = -(i + 1); dp[i] = k; if (i == len) len++; } return len; }}
0 0
- [leetCode刷题笔记]300. Longest Increasing Subsequence
- Leetcode-300.Longest Increasing Subsequence
- 300. Longest Increasing Subsequence LeetCode
- [leetcode] 300. Longest Increasing Subsequence
- leetcode 300. Longest Increasing Subsequence
- LeetCode *** 300. Longest Increasing Subsequence
- LeetCode 300. Longest Increasing Subsequence
- LeetCode-300.Longest Increasing Subsequence
- [leetcode] 300. Longest Increasing Subsequence
- leetcode 300. Longest Increasing Subsequence
- LeetCode 300. Longest Increasing Subsequence
- leetcode 300. Longest Increasing Subsequence
- [LeetCode]--300. Longest Increasing Subsequence
- [leetcode] 300. Longest Increasing Subsequence
- LeetCode 300. Longest Increasing Subsequence
- 【LeetCode】300. Longest Increasing Subsequence
- 【LeetCode】300. Longest Increasing Subsequence
- Leetcode 300. Longest Increasing Subsequence
- 294. Flip Game II
- Go操作XML
- 图像处理之_导数微分
- 自定义View:侧滑菜单动画实现
- 图像处理之_霍夫(Hough)变换
- [leetCode刷题笔记]300. Longest Increasing Subsequence
- VNC安装与配置
- Leetcode 424. Longest Repeating Character Replacement
- C++primer学习笔记-----4.11类型转换
- mybatis整合ss的时候,无法autowire使用mapper的自动注入,找不到bean:NoSuchBeanDefinitionException
- [BZOJ2304][Apio2011]寻路(模拟+spfa)
- 释放Mac OS X硬盘空间
- 七、Linux下SVN服务器搭建(CentOS+Subversion)
- 【正一专栏】第1球和第500球价值一样