[300] 最长上升子序列

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