Dynamic Programming（easy）

53. Maximum Subarray

Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.

1 public int maxSubArray(int[] nums) {
2         int result = nums[0]; 
3         int temp = nums[0];
4         for (int i = 1; i < nums.length; i ++) {
5             temp = nums[i] + temp > nums[i] ? nums[i] + temp : nums[i];
6             result = Math.max(result, temp);
7         }
8         return result;
9     }

View Code