Breaking News: Grepper is joining You.com. Read the official announcement!

maximum subarray leetcode c++

Add Answer

Cute Cat answered on August 24, 2020 Popularity 9/10 Helpfulness 2/10

answer maximum subarray leetcode c++

related maximum subarray solution leetcode

related leetcode maximum subarray sum

related kth largest subarray sum leetcode

related maximum subarray(Java) leetcode solution

maximum subarray leetcode c++

Comment

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        int max_sum = INT_MIN;
        int sum = 0;

        for(int i = 0; i < nums.size(); i++){
           sum += nums[i];

            if(max_sum < sum){
                max_sum = sum;
            }

            if(sum < 0){
                sum = 0;
            }
        }

        return max_sum;
    }
};

Popularity 9/10 Helpfulness 2/10 Language cpp

Source: alkeshghorpade.me

Tags: c++ sub-array

Link to this answer
Share Copy Link

Contributed on Jan 27 2022

Cute Cat

0 Answers Avg Quality 2/10

Closely Related Answers

maximum subarray solution leetcode

Comment

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

Popularity 10/10 Helpfulness 2/10 Language whatever

Source: dev.to

Tags: solution solutio

Link to this answer
Share Copy Link

Contributed on Aug 24 2020

Jolly Jay

0 Answers Avg Quality 2/10

leetcode maximum subarray sum

Comment

arr = [6,7,7,41,5,3,1,3]
# arr = [1,2,3,4,5]
n = 3
def MaxSubarraySum(arr, n) -> int:

  tempSum, maxSum = 0,0
  length = len(arr)
  for i in range(length):
    tempSum += arr[i]
    if i >= n-1:
      maxSum = max(tempSum, maxSum)
      tempSum -= arr[i - (n-1)]
  print(maxSum)
MaxSubarraySum(arr,n)

Popularity 10/10 Helpfulness 1/10 Language python

Source: Grepper

Tags: python py

Link to this answer
Share Copy Link

Contributed on May 15 2022

vip_codes

0 Answers Avg Quality 2/10

kth largest subarray sum leetcode

Comment

def kth_largest_subarray_sum(nums, k):
    n = len(nums)
    subarray_sums = []
    
    for i in range(n):
        curr_sum = 0
        for j in range(i, n):
            curr_sum += nums[j]
            
            # Keep track of all subarray sums
            subarray_sums.append(curr_sum)
    
    # Sort the subarray sums in descending order
    subarray_sums.sort(reverse=True)
    
    # Return the kth largest sum
    return subarray_sums[k - 1]

Popularity 10/10 Helpfulness 1/10 Language python

Source: Grepper

Link to this answer
Share Copy Link

Contributed on Sep 12 2023

YOU.com

0 Answers Avg Quality 2/10

maximum subarray(Java) leetcode solution

Comment

-1

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;
}

Popularity 10/10 Helpfulness 1/10 Language whatever

Source: www.programcreek.com

Tags: solution solutio

Link to this answer
Share Copy Link

Contributed on Sep 14 2021

Arrogant Ant

0 Answers Avg Quality 2/10

maximum subarray leetcode c++

Contents

More Related Answers

maximum subarray leetcode c++

Closely Related Answers

maximum subarray solution leetcode

leetcode maximum subarray sum

kth largest subarray sum leetcode

maximum subarray(Java) leetcode solution

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.