#Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum #and return its sum. #Explanation: [4,-1,2,1] has the largest sum = 6. #The first ...
# return the minimal length of a contiguous subarray [numsl, numsl+1, ..., # numsr-1, numsr] of which the sum is greater than or equal to target. If there # is no such subarray, return 0 instead.