題目鏈接： LeetCode 53 — Maximum Subarray
AC代碼：
public class PRoblem53 { public static void main(String[] args) { // TODO Auto-generated method stub } public int maxSubArray(int[] nums) { int maxSoFar=nums[0], maxEndingHere=nums[0]; for (int i=1;i<nums.length;++i){ maxEndingHere= Math.max(maxEndingHere+nums[i],nums[i]); maxSoFar=Math.max(maxSoFar, maxEndingHere); } return maxSoFar; }}新聞熱點
疑難解答
