LeetCode: Maximum Subarray

自己想得太复杂了，网上查了别人的代码。。太简单了。。

 1 class Solution {
 2 public:
 3     int maxSubArray(int A[], int n) {
 4         // Start typing your C/C++ solution below
 5         // DO NOT write int main() function
 6         int sum = 0;
 7         int ret = INT_MIN;
 8         for(int i = 0 ; i < n; ++i) {
 9             sum += A[i];
10             ret = max(ret, sum);
11             sum = max(sum, 0);
12         }
13         return ret;
14     }
15 };

 1 public class Solution {
 2     public int MaxSubArray(int[] nums) {
 3         int sum = 0;
 4         int ans = Int32.MinValue;
 5         for (int i = 0; i < nums.Length; i++) {
 6             sum += nums[i];
 7             ans = Math.Max(ans, sum);
 8             sum = Math.Max(sum, 0);
 9         }
10         return ans;
11     }
12 }

View Code

转载于:https://www.cnblogs.com/yingzhongwen/archive/2013/04/08/3007134.html

LeetCode: Maximum Subarray相关推荐

[LeetCode] Maximum Subarray 最大子数组
Find the contiguous subarray within an array (containing at least one number) which has the largest ...
LeetCode: Maximum Subarray 解题报告
Maximum Subarray Find the contiguous subarray within an array (containing at least one number) which ...
[LeetCode] Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest ...
LeetCode Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest ...
LeetCode - Maximum Subarray
题目: Find the contiguous subarray within an array (containing at least one number) which has the larg ...
【DP】LeetCode 53. Maximum Subarray
LeetCode 53. Maximum Subarray Solution1:我的答案动态规划 class Solution { public:int maxSubArray(vector< ...
【动态规划】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: Maximum Subarray

LeetCode: Maximum Subarray相关推荐

最新文章

热门文章