【剑指offer】连续子数组最大和

	static int sum(int a[]) {
		int thissum = 0;
		int max = Integer.MIN_VALUE;
		for (int i : a) {
			thissum += i;
			if (thissum > max) {
				max = thissum;
			}
			if (thissum < 0) {
				thissum = 0;
			}

		}
		return max;
	}