[leetcode] maximum subarray

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

For example, given the array [-2,1,-3,4,-1,2,1,-5,4],
the contiguous subarray [4,-1,2,1] has the largest sum = 6.

• 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

  public int (int[] nums) { int temp = 0; int max = nums[0]; for (int i = 0; i < nums.length; i++) { if (temp + nums[i] > 0) { temp += nums[i]; max = Math.max(max, temp); } else { temp = 0; } } if (max == nums[0]) { for (int i = 0; i < nums.length; i++) { max = Math.max(max, nums[i]); } } return max; }