300. 最长递增子序列

class Solution {
public:
    int lengthOfLIS(vector<int>& nums) {
        int result = 0;
        int minn = INT_MIN;
        int temp = 0;
        result = max_son(nums ,0,minn,temp);
        return result;
    }
    int max_son(vector<int>& nums, int place,int minn,int temp){
        if(place >= nums.size()){
            return 0;
        } 
        int result = max_son(nums,place+1,minn,temp);
        if(nums[place] > minn){
            result=max(max_son(nums,place+1,nums[place],temp)+1,result);
        }
        return result+temp;
    }
};