最大子序和
题目出处:https://leetcode-cn.com/problems/maximum-subarray/
状态定义:dp[i]代表以nums[i]为结尾的连续子数组最大和
状态转移方程:dp[i] = max(dp[i-1]+nums[i], nums[i])
结果:max(dp[i]), i = 0,1…,n-1
class Solution {
public:
int maxSubArray(vector<int>& nums) {
int n = nums.size();
vector<int> dp(n, 0); //以i为结尾的连续子数组的最大和
dp[0] = nums[0];
for(int i = 1; i < n; ++i){
dp[i] = max(dp[i-1]+nums[i], nums[i]);
}
return *max_element(dp.begin(), dp.end());
}
};
最长递增子序列
题目出处:https://leetcode-cn.com/problems/longest-increasing-subsequence/
状态定义:dp[i]以nums[i]为结尾的最长上升子序列的长度
class Solution {
public:
int lengthOfLIS(vector<int>& nums) {
int n = nums.size();
vector<int> dp(n, 1);
// dp[i]:以nums[i]为结尾的最长上升子序列的长度
for(int i = 1; i < n; ++i){
for(int j = 0; j < i; ++j){
if(nums[i] > nums[j]){
dp[i] = max(dp[i], dp[j]+1);
}
}
}
return *max_element(dp.begin(), dp.end());
}
};