[LeetCode]Longest Increasing Subsequence
来源:互联网 发布:软件项目风险管理计划 编辑:程序博客网 时间:2024/06/06 00:00
Given an unsorted array of integers, find the length of longest increasing subsequence.
For example,
Given [10, 9, 2, 5, 3, 7, 101, 18]
,
The longest increasing subsequence is [2, 3, 7, 101]
, therefore the length is 4
. Note that there may be more than one LIS combination, it is only necessary for you to return the length.
Your algorithm should run in O(n2) complexity.
Follow up: Could you improve it to O(n log n) time complexity?
题解:动态规划题目
code:
public class Solution { public int lengthOfLIS(int[] nums) { if(nums.length == 0) return 0; int max = 1; int[] dp = new int[nums.length]; Arrays.fill(dp,1); for(int i=1; i<nums.length; i++) { for(int j=0; j<i; j++) { if(nums[i]> nums[j]) { if(dp[j]+1>dp[i]) dp[i] = dp[j]+1; } } if(max<dp[i]) max = dp[i]; } return max; }}
0 0
- [LeetCode]Longest Increasing Subsequence
- [LeetCode] Longest Increasing Subsequence
- leetcode-Longest Increasing Subsequence
- [LeetCode]Longest Increasing Subsequence
- *LeetCode-Longest Increasing Subsequence
- Leetcode: Longest Increasing Subsequence
- LeetCode Longest Increasing Subsequence
- LeetCode -- Longest Increasing Subsequence
- [Leetcode]Longest Increasing Subsequence
- LeetCode Longest Increasing Subsequence
- Longest increasing subsequence |LeetCode
- Leetcode Longest Increasing Subsequence
- Leetcode: Longest Increasing Subsequence
- 【Leetcode】Longest Increasing Subsequence
- [Leetcode]Longest Increasing Subsequence
- leetcode--Longest Increasing Subsequence
- [LeetCode]Longest Increasing Subsequence
- [leetcode]Longest Increasing Subsequence
- 算法学习(三)字符串查找,删除,复制strstr/strcpy/strpbrk等库函数
- 消息中间件与JMS
- Oral Presentations: Tips on How to Deliver a Speech for School or Work
- -[UIWindow endDisablingInterfaceAutorotationAnimated:]
- 模板类和友元函数再探
- [LeetCode]Longest Increasing Subsequence
- 浅谈ES6 let命令
- 翻转格子poj 1753
- Sharepoint 轻量化应用构建之熟悉Sharepoint Designer 2013!
- a标签加入单击事件 屏蔽href跳转页面
- json get请求 img src 带 中文 解决
- 转载自大牛的博文-解决大批量插入数据到数据库中的问题
- 内容提供器(Content Provider)--跨程序共享数据
- 位运算——用位存储40亿个40亿以内的整数