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

class Solution(object):
    def maxSubArray(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
    max_sum, temp = nums[0], 0
    for i in range(len(nums)):
        temp += nums[i]
        max_sum, temp = max(max_sum, temp), max(temp, 0)

    return max_sum