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.

代码：最大子序列和

public static int maxSubArray(int[] A) {int maxsum = 0,tmpsum = 0;for(int i = 0; i < A.length; i++){if(i == 0)maxsum = A[i];tmpsum += A[i];if(tmpsum > maxsum)maxsum = tmpsum;if(tmpsum < 0)tmpsum = 0;}return maxsum;    }

参考：http://blog.csdn.net/tangximing123/article/details/21876219