2789. Largest Element in an Array after Merge Operations LeetCode Solution

In this guide, you will get 2789. Largest Element in an Array after Merge Operations LeetCode Solution with the best time and space complexity. The solution to Largest Element in an Array after Merge Operations problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.

Table of Contents

1. Problem Statement
2. Complexity Analysis
3. Largest Element in an Array after Merge Operations solution in C++
4. Largest Element in an Array after Merge Operations solution in Java
5. Largest Element in an Array after Merge Operations solution in Python
6. Additional Resources

Problem Statement of Largest Element in an Array after Merge Operations

You are given a 0-indexed array nums consisting of positive integers.
You can do the following operation on the array any number of times:

Choose an integer i such that 0 <= i < nums.length – 1 and nums[i] <= nums[i + 1]. Replace the element nums[i + 1] with nums[i] + nums[i + 1] and delete the element nums[i] from the array.

Return the value of the largest element that you can possibly obtain in the final array.

Example 1:

Input: nums = [2,3,7,9,3]
Output: 21
Explanation: We can apply the following operations on the array:
– Choose i = 0. The resulting array will be nums = [5,7,9,3].
– Choose i = 1. The resulting array will be nums = [5,16,3].
– Choose i = 0. The resulting array will be nums = [21,3].
The largest element in the final array is 21. It can be shown that we cannot obtain a larger element.

Example 2:

Input: nums = [5,3,3]
Output: 11
Explanation: We can do the following operations on the array:
– Choose i = 1. The resulting array will be nums = [5,6].
– Choose i = 0. The resulting array will be nums = [11].
There is only one element in the final array, which is 11.

Constraints:

1 <= nums.length <= 105
1 <= nums[i] <= 106

Complexity Analysis

• Time Complexity: O(n)
• Space Complexity: O(1)

2789. Largest Element in an Array after Merge Operations LeetCode Solution in C++

class Solution {
 public:
  long long maxArrayValue(vector<int>& nums) {
    long ans = nums.back();

    for (int i = nums.size() - 2; i >= 0; --i)
      if (nums[i] > ans)
        ans = nums[i];
      else
        ans += nums[i];

    return ans;
  }
};
/* code provided by PROGIEZ */

2789. Largest Element in an Array after Merge Operations LeetCode Solution in Java

class Solution {
  public long maxArrayValue(int[] nums) {
    long ans = nums[nums.length - 1];

    for (int i = nums.length - 2; i >= 0; --i)
      if (nums[i] > ans)
        ans = nums[i];
      else
        ans += nums[i];

    return ans;
  }
}
// code provided by PROGIEZ

2789. Largest Element in an Array after Merge Operations LeetCode Solution in Python

class Solution:
  def maxArrayValue(self, nums: list[int]) -> int:
    ans = nums[-1]

    for i in range(len(nums) - 2, -1, -1):
      if nums[i] > ans:
        ans = nums[i]
      else:
        ans += nums[i]

    return ans
 # code by PROGIEZ

Additional Resources

• Explore all LeetCode problem solutions at Progiez here
• Explore all problems on LeetCode website here

Happy Coding! Keep following PROGIEZ for more updates and solutions.