动态规划法
时间复杂度O(n*n)
c++代码实现:
int maxLengthIncSub(int nums[],int n){
int length[n] = {0};
int maxLength = 1;
for(int i=0;i<n;i++){
length[i] = 1;
for(int j=0;j<i;j++){
if(nums[j] < nums[i]&&(length[j]+1)>length[i]){
//加1加的是nums[i]
length[i] = length[j] + 1;//更新length[i]
}//if
}//for
if(maxLength < length[i])
maxLength = length[i];
}//for
return maxLength;
}