maximum subarray solution leetcode
def approach3(nums):
ans = nums[0]
subarr_sum = nums[0]
for i in range(1, len(nums)):
subarr_sum = max(nums[i], nums[i] + subarr_sum)
ans = max(ans, subarr_sum)
return ans
maximum subarray solution leetcode
def approach3(nums):
ans = nums[0]
subarr_sum = nums[0]
for i in range(1, len(nums)):
subarr_sum = max(nums[i], nums[i] + subarr_sum)
ans = max(ans, subarr_sum)
return ans
maximum subarray(Java) leetcode solution
public int maxSubArray(int[] nums) {
int result = nums[0];
int sum = nums[0];
for(int i=1; i<nums.length; i++){
sum = Math.max(nums[i], sum + nums[i]);
result = Math.max(result, sum);
}
return result;
}
Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us