leetcode:Maximum Subarray---python

题目描述：

Maximum Subarray

 Total Accepted: 19365 Total
Submissions: 58198My Submissions

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

.
click to show more practice.

代码：

class Solution:

    # @param A, a list of integers

    # @return an integer

    def maxSubArray(self, A):

        result = min(A);

        now = 0;

        for i in range(0, len(A)):

            now = max(now, 0);

            now = now + A[i];

            result = max(now, result);

            

                

        return max(result,now);