连续子数组的最大和

 1 public class Solution {
 2     public int FindGreatestSumOfSubArray(int[] array) {
 3         int n = array.length;
 4         int []dp = new int[n + 1];
 5         if (n == 0) return 0;
 6         int ans = array[0];
 7         for (int i = 0; i < n; ++i) {
 8             if (i == 0) {
 9                 dp[i] = array[i];
10                
11                 continue;
12             }
13             dp[i] = Math.max(array[i], array[i] + dp[i - 1]);
14         }
15         
16         
17         for (int i = 0; i < n; ++i) ans = Math.max(ans, dp[i]);
18         return ans;
19     }
20 }