LeetCode 2234: Maximum Total Beauty of the Gardens Solution

Master LeetCode problem 2234 (Maximum Total Beauty of the Gardens), a hard challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

2234. Maximum Total Beauty of the Gardens

Hard

Array Two Pointers Binary Search Greedy Sorting Enumeration Prefix Sum

Problem Explanation

Explanation

To solve this problem, we can follow these steps:

Initialize variables to keep track of the total beauty, the number of complete gardens, and the minimum number of flowers in any incomplete garden.
Iterate through the gardens and calculate the total beauty based on the current state.
Keep planting flowers in the incomplete gardens until we have planted all newFlowers or all gardens are complete.
Calculate the total beauty based on the final state after planting the flowers.
Return the maximum total beauty obtained.

Time complexity: O(n) Space complexity: O(1)

Solution Code

class Solution {
    public int maxTotalBeauty(int[] flowers, int newFlowers, int target, int full, int partial) {
        int totalBeauty = 0;
        int completeGardens = 0;
        int minIncomplete = Integer.MAX_VALUE;
        
        for (int flower : flowers) {
            if (flower >= target) {
                totalBeauty += full;
                completeGardens++;
            } else {
                minIncomplete = Math.min(minIncomplete, flower);
            }
        }
        
        int remainingFlowers = newFlowers;
        while (remainingFlowers > 0 && minIncomplete < target) {
            totalBeauty += partial;
            minIncomplete++;
            remainingFlowers--;
        }
        
        totalBeauty += (Math.min(remainingFlowers, target - minIncomplete)) * partial;
        totalBeauty += Math.min(newFlowers, target - minIncomplete - remainingFlowers) * full;
        
        return totalBeauty;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2234 (Maximum Total Beauty of the Gardens)?

This page provides optimized solutions for LeetCode problem 2234 (Maximum Total Beauty of the Gardens) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 2234 (Maximum Total Beauty of the Gardens)?

The time complexity for LeetCode 2234 (Maximum Total Beauty of the Gardens) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2234 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 2234 in Java, C++, or Python.

Back to LeetCode Solutions