LeetCode 1354: Construct Target Array With Multiple Sums Solution

Master LeetCode problem 1354 (Construct Target Array With Multiple Sums), 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.

1354. Construct Target Array With Multiple Sums

Hard

Array Heap (Priority Queue)

Problem Explanation

Explanation:

To construct the target array from an array of 1s, we can simulate the process of building the target array by repeatedly finding the maximum element in the array and updating it based on the sum of the rest of the elements. We continue this process until the array contains only the elements from the target array.

Detailed steps:

Calculate the sum of all elements in the target array.
Find the maximum element in the array and subtract the sum of all elements except the maximum element.
Update the maximum element with the result.
Continue this process until all elements in the array match the target array.

If at any point the array contains negative numbers or all elements are the same (indicating a cycle), we return false.

Time complexity: O(nlogn) where n is the size of the target array. Space complexity: O(n) where n is the size of the target array.

Solution Code

import java.util.PriorityQueue;

class Solution {
    public boolean isPossible(int[] target) {
        PriorityQueue<Integer> pq = new PriorityQueue<>((a, b) -> b - a);
        long sum = 0;
        for (int num : target) {
            sum += num;
            pq.offer(num);
        }
        
        while (true) {
            int max = pq.poll();
            sum -= max;
            if (max == 1 || sum == 1) {
                return true;
            }
            if (max < sum || sum == 0 || max % sum == 0) {
                return false;
            }
            max %= sum;
            sum += max;
            pq.offer(max);
        }
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 1354 (Construct Target Array With Multiple Sums)?

This page provides optimized solutions for LeetCode problem 1354 (Construct Target Array With Multiple Sums) 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 1354 (Construct Target Array With Multiple Sums)?

The time complexity for LeetCode 1354 (Construct Target Array With Multiple Sums) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 1354 on DevExCode?

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

Back to LeetCode Solutions