Java for LeetCode 053 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.

解題思路：

看題目，一次遍曆肯定能搞定問題，只需使用一個sum計算遍曆下來可能的最大的和，一個maxSum記錄數目的最大值，maxSum即為所求，JAVA實現如下：

static public int maxSubArray(int[] nums) {  int sum=nums[0],maxSum=sum;  for(int i=1;i<nums.length;i++){  if(sum<=0)  sum=nums[i];  else  sum+=nums[i];  maxSum=Math.max(maxSum, sum);  }  return maxSum;  }

 

Java for LeetCode 053 Maximum Subarray