题目:
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?
tips:最长上升子序列,动态规划的经典题目,网上教程有很多,不多解释了
代码
public class Solution {
public int lengthOfLIS(int[] nums) {
if(nums==null || nums.length<1)
return 0;
int []dp=new int[nums.length];
dp[0]=1;
int max=1;
for (int i = 1; i <nums.length ; i++) {
dp[i]=1;
for (int j = 0; j <i; j++) {
if(nums[i]>nums[j])
{
dp[i]=Math.max(dp[i],dp[j]+1);
}
}
max=Math.max(max,dp[i]);
}
return max;
}
}