g0001_0100.s0053_maximum_subarray.Solution.c Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-all Show documentation

104 LeetCode algorithm problem solutions

There is a newer version: 1.8

// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
// #Divide_and_Conquer #Data_Structure_I_Day_1_Array #Dynamic_Programming_I_Day_5
// #Udemy_Famous_Algorithm #Big_O_Time_O(n)_Space_O(1)
// #2024_10_30_Time_0_ms_(100.00%)_Space_14.4_MB_(89.88%)

#include 
#include 

int maxSubArray(int* nums, int numsSize) {
    int maxi = INT_MIN;
    int sum = 0;
    for (int i = 0; i < numsSize; i++) {
        sum += nums[i];
        maxi = (sum > maxi) ? sum : maxi;
        
        if (sum < 0) {
            sum = 0;
        }
    }
    return maxi;
}