g0001_0100.s0053_maximum_subarray.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g0001_0100.s0053_maximum_subarray;
// #Easy #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 #2022_06_17_Time_2_ms_(63.61%)_Space_73.2_MB_(69.03%)
public class Solution {
public int maxSubArray(int[] nums) {
int maxi = Integer.MIN_VALUE;
int sum = 0;
for (int num : nums) {
// calculating sub-array sum
sum += num;
maxi = Math.max(sum, maxi);
if (sum < 0) {
// there is no point to carry a -ve subarray sum. hence setting to 0
sum = 0;
}
}
return maxi;
}
}