leetcode 300 最长上升子序列

地址：https://leetcode-cn.com/problems/longest-increasing-subsequence/
大意：给定一个数组，找到最长上升子序列

//时间复杂度O(n^2)，动态规划
class Solution {
public:
    int lengthOfLIS(vector& nums) {
        if(nums.size() == 0){
            return 0;
        }
        int dp[nums.size()];
        dp[0] = 1;
        int res = 1;
        for(int i = 1 ; i < nums.size() ; i ++ ){
            dp[i] = 1;
            for(int j = 0 ; j < i ; j ++ ){
                if(nums[i] > nums[j]){
                    dp[i] = max(dp[i],dp[j]+1);
                    res = max(dp[i],res);
                }
            }
        }
        return res;
    }
};