1 条题解

  • 1
    @ 2024-1-28 14:38:10
    
    #include <bits/stdc++.h>
    using namespace std;
    int maxSubArray(vector nums) {
        int n = nums.size();
        if (n == 0) {
            return 0;
        }
        int maxSum = nums[0];
        int currentSum = nums[0];
        for (int i = 1; i < n; i++) {
            if (currentSum < 0) {
                currentSum = nums[i];
            } 
            else {
                currentSum += nums[i];
            }
            maxSum = max(maxSum, currentSum);
        }
        return maxSum;
    }
    int main() {
        vector nums = {-2, 1, -3, 4, -1, 2, 1, -5, 4};
        int maxSum = maxSubArray(nums);
        cout<< maxSum << endl;
        return 0;
    }
    
    • 1

    信息

    ID
    319
    时间
    1000ms
    内存
    256MiB
    难度
    10
    标签
    (无)
    递交数
    18
    已通过
    0
    上传者