300. Longest Increasing Subsequence

简单题DP

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