35_leetcode_Maximum Subarray
来源:互联网 发布:mac跳转指定目录 编辑:程序博客网 时间:2024/06/06 09:03
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
For example, given the array [−2,1,−3,4,−1,2,1,−5,4]
,
the contiguous subarray [4,−1,2,1]
has the largest sum = 6
1:特殊情况, A == NULL , n <= 0; 2: 当数组中全部是不大于0的数, 返回最大值;3:设置两个变量,一个保存当前子串最大值,一个是总体子串最大值,根据当前子串最大值更新总体子串最大。
int maxSubArray(int A[], int n) { if( A == NULL || n <= 0 ) { return 0; } int maxNumber = A[0]; for(int i = 0; i < n; i++) { if(A[i] > maxNumber) { maxNumber = A[i]; } } if(maxNumber <= 0) { return maxNumber; } int maxSub = 0; int tempSub = 0; for(int i = 0; i < n; i++) { tempSub += A[i]; if(tempSub > maxSub) { maxSub = tempSub; } if(tempSub < 0) { tempSub = 0; } } return maxSub; }
0 0
- 35_leetcode_Maximum Subarray
- 151_leetcode_Maximum Product Subarray
- 88_leetcode_Maximum Depth of Binary Tree
- 209. Minimum Size Subarray Sum 【M】【35】
- maximum subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- subArray Related
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- CSDN论坛问答质量提升计划
- 33_leetcode_Rotate Image
- iptables
- 34_leetcode_Jump Game
- dojo官网
- 35_leetcode_Maximum Subarray
- 36_leetcode_Count and Say
- 读《一年一度屈原祭,端午时节话公知》有感
- 在Android中动态载入自定义类
- 如何使用SSH框架开发实际项目-开发规范
- Spring MVC 框架搭建及详解
- 37_leetcode_Trapping Rain water
- 循环次数
- 神经网络手写体识别演示VC项目