

class Solution(object):
    """
    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.
    """
    def find_maximum_subarray(self, nums):
        max_sum = nums[0]
        current_sum = nums[0]

        for i in range(1, len(nums)):
            if current_sum < 0:
                current_sum = 0

            current_sum += nums[i]

            if max_sum < current_sum:
                max_sum = current_sum



        return max_sum


if __name__ == "__main__":
    sol = Solution()
    print(sol.find_maximum_subarray([-2, 1, -3, 4, -1, 2, 1, -5, 4]))
    print(sol.find_maximum_subarray([-2, 1]))
