【面试题31】连续子数组的最大和

 1         public static int FindGreatestSumOfSubArray(int[] arr)
 2         {
 3             if (arr == null || arr.Length < 1)
 4                 return -1;
 5 
 6             int max = arr[0];
 7             int prev = arr[0];
 8 
 9             for (int i = 1; i < arr.Length; i++)
10             {
11                 if (arr[i] + prev > arr[i])
12                 {
13                     prev += arr[i];
14                 }
15                 else
16                 {
17                     prev = arr[i];
18                 }
19 
20                 max = prev > max ? prev : max;
21             }
22 
23             return max;
24         }