leetcode JAVA Maximum Subarray 难度系数3 3.17

最新推荐文章于 2018-04-18 13:14:41 发布

yundomo

最新推荐文章于 2018-04-18 13:14:41 发布

阅读量657

点赞数

本文链接：https://blog.csdn.net/yiding_he/article/details/18893567

版权

leetcode java 150 专栏收录该内容

86 篇文章 0 订阅

订阅专栏

Question:

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.

click to show more practice.

public class Solution {
     public int maxSubArray(int[] A) {
        int result = Integer.MIN_VALUE;
        int f =0;
        for(int i =0;i<A.length;i++){
        	f = Math.max(f+A[i], A[i]);
        	result = Math.max(result, f);
        }
    	return result;
    }
}