LeetCode-53-Maximum Subarray(C语言实现)
2018-01-03 05:26
369 查看
int maxSubArray(int* nums, int numsSize) {
if(numsSize == 0) return 0;
if(numsSize == 1) return nums[0];
int max = nums[0];
int sum = nums[0];
for(int i = 1; i < numsSize; ++i){
if(sum < 0) sum = 0;
sum += nums[i];
if(sum > max) max = sum;
}
return max;
}
if(numsSize == 0) return 0;
if(numsSize == 1) return nums[0];
int max = nums[0];
int sum = nums[0];
for(int i = 1; i < numsSize; ++i){
if(sum < 0) sum = 0;
sum += nums[i];
if(sum > max) max = sum;
}
return max;
}
相关文章推荐
- LeetCode-59-Spiral Matrix II(C语言实现)
- [leetcode]Length of Last Word (求最后一个单词的长度 C语言实现)
- LeetCode-62-Unique Paths(C语言实现)
- [leetcode]Same Tree(判断两个二叉树是否相等 C语言实现)
- LeetCode-7-Reverse Integer(C语言实现)
- LeetCode-14-Longest Common Prefix(C语言实现)
- [leetcode]Count and Say (伯爵说 C语言实现)
- [leetcode](Gray Code 格雷码 C语言实现)
- LeetCode-747-Min Cost Climbing Stairs(C语言实现)
- LeetCode-26-Remove Duplicates from Sorted Array(C语言实现)
- [leetcode]Symmetric Tree (对称树 C语言实现)
- LeetCode-6-ZigZag Conversion(C语言实现)
- LeetCode-19-Remove Nth Node From End of List(C语言实现)
- LeetCode-21-Merge Two Sorted Lists(C语言实现)
- LeetCode-27-Remove Element(C语言实现)
- [leetcode]Valid Palindrome (判断回文数 C语言实现)
- [leetcode]Validate Binary Search Tree (判断有效二叉搜索树 C语言实现)
- LeetCode-25-Reverse Nodes in k-Group(C语言实现)
- LeetCode-748-Largest Number At Least Twice of Others(C语言实现)
- LeetCode-18-4Sum(C语言实现)