[leetcode.com]算法题目 - Maximum Subarray
摘要:
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 class Solution { 2 public: 3 int maxSubArray(int A[], int n) { 4 // Start... 阅读全文
posted @ 2013-09-11 22:27 Horstxu 阅读(201) 评论(0) 推荐(0) 编辑