LeetCode每日一题（2018-01-26）

最新推荐文章于 2024-09-13 18:41:09 发布

Elync

最新推荐文章于 2024-09-13 18:41:09 发布

阅读量284

点赞数

分类专栏： LeetCode Android

本文链接：https://blog.csdn.net/u013930351/article/details/79171863

版权

Android 同时被 2 个专栏收录

14 篇文章 0 订阅

订阅专栏

LeetCode

10 篇文章 0 订阅

订阅专栏

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.

我的代码：

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