LeetCode 53. Maximum Subarray

Solution1：我的答案
动态规划

class Solution {
public:int maxSubArray(vector<int>& nums) {int n = nums.size();if (!nums.size()) return -1;if (nums.size() == 1) return nums[0];int dp[n] = {0}, max_sum = INT_MIN;dp[0] = nums[0];max_sum = dp[0];for (int i = 1; i < n; i++) {dp[i] = nums[i] + max(dp[i-1], 0);max_sum = max(max_sum, dp[i]);}return max_sum;}
};

优化版：

class Solution {
public:int maxSubArray(vector<int>& nums) {int temp = nums[0], res = temp;for (int i = 1; i < nums.size(); i++) {temp = nums[i] + max(temp, 0);res = max(res, temp);}return res;}
};

【DP】LeetCode 53. Maximum Subarray相关推荐

【动态规划】LeetCode 53. Maximum Subarray
LeetCode 53. Maximum Subarray 原题描述(求子序列最大和/最大子串):Find the contiguous subarray within an array (conta ...
[Lintcode]41. Maximum Subarray/[Leetcode]53. Maximum Subarray
41. Maximum Subarray/53. Maximum Subarray 本题难度: Eas Topic: Dynamic Programming Description Given an ...
LeetCode(53):Maximum Subarray
Maximum Subarray: Find the contiguous subarray within an array (containing at least one number) whic ...
leetCode 53. maximum subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest ...
【DP】LeetCode 64. Minimum Path Sum
LeetCode 64. Minimum Path Sum Solution1:标准的动态规划题目 class Solution { public:int minPathSum(vector<v ...
【DP】LeetCode 85. Maximal Rectangle
LeetCode 85. Maximal Rectangle Solution1: 一语惊醒梦中人啊,参考链接:https://www.youtube.com/watch?v=2Yk3Avrzauk ...
[LeetCode]: 53: Maximum Subarray
题目: Find the contiguous subarray within an array (containing at least one number) which has the larg ...
LeetCode#53 Maximum Subarray
Problem Difinition: Find the contiguous subarray within an array (containing at least one number) wh ...
C#解leetcode 53.Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest ...

【DP】LeetCode 53. Maximum Subarray

LeetCode 53. Maximum Subarray

【DP】LeetCode 53. Maximum Subarray相关推荐

最新文章

热门文章