LeetCode No.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 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?

====================================================================================
题目链接：https://leetcode.com/problems/longest-increasing-subsequence/

题目大意：给定一个数组，求出数组中最长递增子序列长度。

思路：用动态规划（DP）的方法，新建一个和nums一样长的数组dp[n]，其中dp[i]表示从0到i的最长子序列长度。

1、初始化dp[i]=1

2、对所有i < j，如果满足nums[i] < nums[j]，则 dp[j] = max ( dp[j], dp[i] + 1 )

3、最后找出最大的dp[i]就是答案

附上代码：

class Solution {
public:
    int lengthOfLIS(vector<int>& nums) {
        int n = nums.size() , ans = 0 ;
        if ( n == 0 )
            return 0 ;
        vector <int> dp ( n , 1 ) ;
        for ( int i = 0 ; i < n - 1 ; i ++ )
            for ( int j = i + 1 ; j < n ; j ++ )
                if ( nums[i] < nums[j] ) 
                    dp[j] = max ( dp[j] , dp[i] + 1 ) ;
        for ( int i = 0 ; i < n ; i ++ )
            ans = max ( ans , dp[i] ) ;
        return ans ;
    }
};