求数组中相邻的数字中的最大和

 

 1public static int LargeSum(int[] input)
 2        {
 3            int sum = 0, maxSum = -((int)Math.Pow(2, 32) - 1);
 4
 5            for (int i = 0; i < input.Length; i++)
 6            {
 7                sum += input[i];
 8                if (maxSum < sum)
 9                {
10                    maxSum = sum;
11                }
12                if (sum < 0)
13                {
14                    sum = 0;
15                }
16            }
17
18            return maxSum;
19        }

 

转载于:https://www.cnblogs.com/tommyhuzun/archive/2009/11/05/1596965.html