300 Longest Increasing Subsequence

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 is4. 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(nlogn) time complexity?

Solution)

Use the additional array to count increasing subsequence.

class Solution {
    public int lengthOfLIS(int[] nums) {
        if (nums.length < 2) return nums.length;
        int[] count = new int[nums.length];
        for (int i=0; i<nums.length; i++) {
            count[i] = 1;
        }
        int longest = 1;
        for (int i=1; i<nums.length; i++) {
            for (int j=0; j<i; j++) {
                if (nums[i] > nums[j]) {
                    count[i] = Math.max(count[i], count[j]+1);
                    if (count[i] > longest) longest = count[i];
                }
            }
        }
        return longest;
    }
}