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

maximum-sum-such-that-no-two-elements-are-adjacent

Manthan Dhole answered on September 23, 2022 Popularity 3/10 Helpfulness 1/10

answer maximum-sum-such-that-no-two-elements-are-adjacent

related maximum-sum-such-that-no-two-elements-are-adjacent

maximum-sum-such-that-no-two-elements-are-adjacent

Comment

/*package whatever //do not write package name here */
import java.io.*;
 
class GFG
{
 
  // Function to find the maximum sum
  static int findMaxSum(int[] arr, int N)
  {
    // Declare dp array
    int[][] dp = new int[N][2];
    if (N == 1) {
      return arr[0];
    }
 
    // Initialize the values in dp array
    dp[0][0] = 0;
    dp[0][1] = arr[0];
 
    // Loop to find the maximum possible sum
    for (int i = 1; i < N; i++) {
      dp[i][1] = dp[i - 1][0] + arr[i];
      dp[i][0] = Math.max(dp[i - 1][1],
                          dp[i - 1][0]);
    }
 
    // Return the maximum sum
    return Math.max(dp[N - 1][0], dp[N - 1][1]);
  }
 
 
  // Driver Code
  public static void main(String args[])
  {
 
    // Creating the array
    int[] arr = { 5, 5, 10, 100, 10, 5 };
    int N = arr.length;
 
    // Function call
    System.out.println(findMaxSum(arr, N));
  }
}
 
// This code is contributed by shinjanpatra

Popularity 3/10 Helpfulness 1/10 Language whatever

Source: www.geeksforgeeks.org

Tags: whatever

Link to this answer
Share Copy Link

Contributed on Sep 23 2022

Manthan Dhole

0 Answers Avg Quality 2/10

Closely Related Answers

maximum-sum-such-that-no-two-elements-are-adjacent

Comment

/*package whatever //do not write package name here */
import java.io.*;
 
class GFG
{
 
  // Function to find the maximum sum
  static int findMaxSum(int[] arr, int N)
  {
    // Declare dp array
    int[][] dp = new int[N][2];
    if (N == 1) {
      return arr[0];
    }
 
    // Initialize the values in dp array
    dp[0][0] = 0;
    dp[0][1] = arr[0];
 
    // Loop to find the maximum possible sum
    for (int i = 1; i < N; i++) {
      dp[i][1] = dp[i - 1][0] + arr[i];
      dp[i][0] = Math.max(dp[i - 1][1],
                          dp[i - 1][0]);
    }
 
    // Return the maximum sum
    return Math.max(dp[N - 1][0], dp[N - 1][1]);
  }
 
 
  // Driver Code
  public static void main(String args[])
  {
 
    // Creating the array
    int[] arr = { 5, 5, 10, 100, 10, 5 };
    int N = arr.length;
 
    // Function call
    System.out.println(findMaxSum(arr, N));
  }
}
 
// This code is contributed by shinjanpatra

Popularity 5/10 Helpfulness 1/10 Language whatever

Source: www.geeksforgeeks.org

Tags: whatever

Link to this answer
Share Copy Link

Contributed on Sep 23 2022

Manthan Dhole

0 Answers Avg Quality 2/10

maximum-sum-such-that-no-two-elements-are-adjacent

Comment

/*package whatever //do not write package name here */
import java.io.*;
 
class GFG
{
 
  // Function to find the maximum sum
  static int findMaxSum(int[] arr, int N)
  {
    // Declare dp array
    int[][] dp = new int[N][2];
    if (N == 1) {
      return arr[0];
    }
 
    // Initialize the values in dp array
    dp[0][0] = 0;
    dp[0][1] = arr[0];
 
    // Loop to find the maximum possible sum
    for (int i = 1; i < N; i++) {
      dp[i][1] = dp[i - 1][0] + arr[i];
      dp[i][0] = Math.max(dp[i - 1][1],
                          dp[i - 1][0]);
    }
 
    // Return the maximum sum
    return Math.max(dp[N - 1][0], dp[N - 1][1]);
  }
 
 
  // Driver Code
  public static void main(String args[])
  {
 
    // Creating the array
    int[] arr = { 5, 5, 10, 100, 10, 5 };
    int N = arr.length;
 
    // Function call
    System.out.println(findMaxSum(arr, N));
  }
}
 
// This code is contributed by shinjanpatra

Popularity 3/10 Helpfulness 1/10 Language whatever

Source: www.geeksforgeeks.org

Tags: whatever

Link to this answer
Share Copy Link

Contributed on Sep 23 2022

Manthan Dhole

0 Answers Avg Quality 2/10

maximum-sum-such-that-no-two-elements-are-adjacent

Comment

/*package whatever //do not write package name here */
import java.io.*;
 
class GFG
{
 
  // Function to find the maximum sum
  static int findMaxSum(int[] arr, int N)
  {
    // Declare dp array
    int[][] dp = new int[N][2];
    if (N == 1) {
      return arr[0];
    }
 
    // Initialize the values in dp array
    dp[0][0] = 0;
    dp[0][1] = arr[0];
 
    // Loop to find the maximum possible sum
    for (int i = 1; i < N; i++) {
      dp[i][1] = dp[i - 1][0] + arr[i];
      dp[i][0] = Math.max(dp[i - 1][1],
                          dp[i - 1][0]);
    }
 
    // Return the maximum sum
    return Math.max(dp[N - 1][0], dp[N - 1][1]);
  }
 
 
  // Driver Code
  public static void main(String args[])
  {
 
    // Creating the array
    int[] arr = { 5, 5, 10, 100, 10, 5 };
    int N = arr.length;
 
    // Function call
    System.out.println(findMaxSum(arr, N));
  }
}
 
// This code is contributed by shinjanpatra

Popularity 3/10 Helpfulness 1/10 Language whatever

Source: www.geeksforgeeks.org

Tags: whatever

Link to this answer
Share Copy Link

Contributed on Sep 23 2022

Manthan Dhole

0 Answers Avg Quality 2/10

maximum-sum-such-that-no-two-elements-are-adjacent

Contents

More Related Answers

maximum-sum-such-that-no-two-elements-are-adjacent

Closely Related Answers

maximum-sum-such-that-no-two-elements-are-adjacent

maximum-sum-such-that-no-two-elements-are-adjacent

maximum-sum-such-that-no-two-elements-are-adjacent

Grepper

Documentation

Social

Legal

Contact

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