[LeetCode] Maximum Subarray
2013-01-28 14:45
423 查看
class Solution { public: int maxSubArray(int A[], int n) { // Start typing your C/C++ solution below // DO NOT write int main() function int ret = A[0]; int sum = 0; for (int i = 0; i < n; i++) { sum < 0 ? sum = A[i] : sum += A[i]; ret = max(ret, sum); } return ret; } };
Small Case: 4ms
Large Case: 44ms
Time: O(n)
Space: O(1)
相关文章推荐
- Leetcode::pow
- [leetcode]Triangle
- 【LeetCode】Binary Tree Postorder Traversal 二叉树后序遍历递归以及非递归算法
- LeetCode 76. Minimum Window Substring
- LeetCode刷题笔录Length of Last Word
- Leetcode-Missing Ranges
- [LeetCode]Convert Sorted List to Binary Search Tree
- Surrounded Regions--LeetCode
- leetcode_69题——Sqrt(x)(二分查找,还有个溢出问题的研究)
- leetcode 日经贴,Cpp code -Sliding Window Maximum
- (leetcode)Product of Array Except Self
- Remove Nth Node From End of List - Leetcode
- [LeetCode202]Happy Number判断一个数是不是happy number
- Leetcode 328:Odd Even Linked List
- [LeetCode] Trips and Users 旅行和用户
- LeetCode 172. Factorial Trailing Zeroes(0结尾)
- leetcode_c++:链表:Intersection of Two Linked Lists(160)
- LeetCode226. Invert Binary Tree
- LeetCode 423. Reconstruct Original Digits from English
- LeetCode Remove Element