http://fisherlei.blogspot.com/2012/12/leetcode-maximum-subarray.html 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…