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

maximum subarray

Add Answer

Java Geek answered on September 9, 2021 Popularity 9/10 Helpfulness 1/10

answer maximum subarray

related maximum sum subarray

related Maximum Subarray sum

related maximum sum subarray

related Maximum subarray sum

related find maximum contiguous Sub arrays

related maximum subarray

maximum subarray

Comment

// A Divide and Conquer based Java
// A for maximum subarray sum
// problem
import java.util.*;
 
class GFG {
 
    // Find the maximum possible sum in arr[]
    // such that arr[m] is part of it
    static int maxCrossingSum(int arr[], int l, int m,
                              int h)
    {
        // Include elements on left of mid.
        int sum = 0;
        int left_sum = Integer.MIN_VALUE;
        for (int i = m; i >= l; i--) {
            sum = sum + arr[i];
            if (sum > left_sum)
                left_sum = sum;
        }
 
        // Include elements on right of mid
        sum = 0;
        int right_sum = Integer.MIN_VALUE;
        for (int i = m; i <= h; i++) {
            sum = sum + arr[i];
            if (sum > right_sum)
                right_sum = sum;
        }
 
        // Return sum of elements on left
        // and right of mid
        // returning only left_sum + right_sum will fail for
        // [-2, 1]
        return Math.max(left_sum + right_sum - arr[m],
                        Math.max(left_sum, right_sum));
    }
 
    // Returns sum of maximum sum subarray
    // in aa[l..h]
    static int maxSubArraySum(int arr[], int l, int h)
    {
          //Invalid Range: low is greater than high
          if (l > h)
              return Integer.MIN_VALUE;
        // Base Case: Only one element
        if (l == h)
            return arr[l];
 
        // Find middle point
        int m = (l + h) / 2;
 
        /* Return maximum of following three
        possible cases:
        a) Maximum subarray sum in left half
        b) Maximum subarray sum in right half
        c) Maximum subarray sum such that the
        subarray crosses the midpoint */
        return Math.max(
            Math.max(maxSubArraySum(arr, l, m-1),
                     maxSubArraySum(arr, m + 1, h)),
            maxCrossingSum(arr, l, m, h));
    }
 
    /* Driver program to test maxSubArraySum */
    public static void main(String[] args)
    {
        int arr[] = { 2, 3, 4, 5, 7 };
        int n = arr.length;
        int max_sum = maxSubArraySum(arr, 0, n - 1);
 
        System.out.println("Maximum contiguous sum is "
                           + max_sum);
    }
}
// This code is contributed by Prerna Saini

Popularity 9/10 Helpfulness 1/10 Language whatever

Source: www.geeksforgeeks.org

Tags: sub-array whatever

Link to this answer
Share Copy Link

Contributed on Aug 27 2022

Java Geek

0 Answers Avg Quality 2/10

Closely Related Answers

maximum sum subarray

Comment

def max_subarray_sum(arr):
    max_sum = float('-inf')
    curr_sum = 0
    start = end = 0
    
    for i in range(len(arr)):
        curr_sum += arr[i]
        
        if curr_sum > max_sum:
            max_sum = curr_sum
            end = i
        if curr_sum < 0:
            curr_sum = 0
            start = i + 1
            
    subarray = arr[start:end+1]
    return subarray, max_sum

# Example usage
arr = [-2, -3, 4, -1, -2, 1, 5, -3]
subarray, max_sum = max_subarray_sum(arr)
print("Subarray with maximum sum:", subarray)
print("Maximum sum:", max_sum)

Popularity 8/10 Helpfulness 2/10 Language python

Source: Grepper

Link to this answer
Share Copy Link

Contributed on Sep 11 2023

YOU.com

0 Answers Avg Quality 2/10

Maximum Subarray sum

Comments(1)

 def maxSubArray(self, nums: List[int]) -> int:
        curr_best = overall_best =  nums[0]
        for i in range(1,len(nums)):
            if curr_best>=0:
                curr_best = curr_best + nums[i]
            else:
                curr_best = nums[i]
            if curr_best > overall_best:
                overall_best = curr_best
        return overall_best

Popularity 10/10 Helpfulness 2/10 Language python

Source: Grepper

Tags: python py

Link to this answer
Share Copy Link

Contributed on May 20 2022

Combative Cardinal

0 Answers Avg Quality 2/10

maximum sum subarray

Comment

public static int SumArray()
{
    var arr = new int[]{ -2, -4, -5, -6, -7, -89, -56 };
    var sum = 0;
    var max = arr[0];
    foreach (var item in arr)
    {
        sum += item;
      // sum = Math.Max(sum,0); resting here will not give  expected output
        max = Math.Max(sum,max);
        sum = Math.Max(sum,0);
    }
    return max;
}

Popularity 10/10 Helpfulness 2/10 Language csharp

Source: Grepper

Tags: algorithm algo

Link to this answer
Share Copy Link

Contributed on Mar 01 2022

PrashantUnity

0 Answers Avg Quality 2/10

Maximum subarray sum

Comment

var maxSequence = function(arr){
  var min = 0, ans = 0, i, sum = 0;
  for (i = 0; i < arr.length; ++i) {
    sum += arr[i];
    min = Math.min(sum, min);
    ans = Math.max(ans, sum - min);
  }
  return ans;
}

Popularity 10/10 Helpfulness 2/10 Language javascript

Source: Grepper

Tags: javascript j

Link to this answer
Share Copy Link

Contributed on Jun 21 2022

ABS

0 Answers Avg Quality 2/10

find maximum contiguous Sub arrays

Comment

#include <iostream>
using namespace std;
int main(){
    int n;
    cin >> n;
    int arr[n];
    for(int i =0;i< n;i++){
        cin >> arr[i];
    }
    
    for (int i = 0; i < n; i++)
    {
        for (int j = i; j < n; j++)
        {
            for (int k = i; k <= j; k++)
            {
                cout << arr[k] << " ";
            }
            cout << endl;
        }
        
    }
    

    return 0;
}

Popularity 9/10 Helpfulness 1/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Sep 09 2021

baba

0 Answers Avg Quality 2/10

maximum subarray

Comment

-1

const maxSubArray = (arr) => {
    let currSum =  getSum(arr, 0, 4);
    let maxSum = 0
    for(let i = 1; i < arr.length - 4; i++){
       currSum =  currSum - arr[i - 1];
       currSum = currSum + arr[i + 3];
        maxSum = Math.max(currSum, maxSum);
    }
    return maxSum;
}

const getSum = (arr, start, end) => {
    let sum = 0;
    for(let i = start; i < end; i++){
        sum += arr[i]
    }
    
    console.log(sum);
    return sum;
}

Popularity 10/10 Helpfulness 1/10 Language whatever

Source: Grepper

Tags: sub-array sub-

Link to this answer
Share Copy Link

Contributed on Jan 27 2022

Smiling Shrew

0 Answers Avg Quality 2/10

maximum subarray

Contents

More Related Answers

maximum subarray

Closely Related Answers

maximum sum subarray

Maximum Subarray sum

maximum sum subarray

Maximum subarray sum

find maximum contiguous Sub arrays

maximum subarray

Grepper

Documentation

Social

Legal

Contact

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