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?
O(n2)动态规划解法:
public class Solution {
public int lengthOfLIS(int[] nums) {
if(nums == null || nums.length == 0)
return 0;
if(nums.length == 1)
return 1;
int[] record = new int[nums.length];
record[0] = 1;
int max = 1;
for(int i = 1; i < nums.length; i++){
int current = nums[i];
int localMax = 1;
for(int j = 0; j < i; j++){
if(current > nums[j] && record[j] + 1 > localMax)
localMax = record[j] + 1;
}
record[i] = localMax;
if(localMax > max)
max = localMax;
}
return max;
}
}