class Solution {
public:
/*
* @param nums: An integer array
* @return: The length of LIS (longest increasing subsequence)
*/
int longestIncreasingSubsequence(vector<int> &nums) {
// write your code here
if(nums.empty())
return 0;
int dp[nums.size()];
dp[0]=1;
for(int i=0;i<nums.size();i++)
{
dp[i]=1;
for(int j=0;j<i;j++)
{
if(nums[i]>nums[j])
{
int temp=dp[j]+1;
dp[i]=dp[i]>temp?dp[i]:temp;
}
}
}
int res=*max_element(dp,dp+nums.size());
return res;
}
};
lintcode 最长上升子序列
最新推荐文章于 2022-06-27 17:12:31 发布