leetcode系列之53最大子序和

最新推荐文章于 2024-09-18 11:04:20 发布

zane197

最新推荐文章于 2024-09-18 11:04:20 发布

阅读量126

点赞数

分类专栏： # leetcode 文章标签： leetcode maxsubarray

本文链接：https://blog.csdn.net/zhao__zhen/article/details/88551972

版权

leetcode 专栏收录该内容

20 篇文章 0 订阅

订阅专栏

public class MaxSubArray {

    public static void main(String[] args) {
        int[] nums = {-2, 1, -3, 4, -1, 2, 1, -5, 4};
        System.out.println(maxSubArray(nums));

//        for (int i = 0; i < nums.length; i++)
//            System.out.print(nums[i] + "  ");
    }


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

            maxSum = Math.max(maxSum, sum);

        }
        return maxSum;
    }


}