D
DevExCode

LeetCode 1441: Build an Array With Stack Operations Solution

Master LeetCode problem 1441 (Build an Array With Stack Operations), a medium 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.

1441. Build an Array With Stack Operations

Medium
ArrayStackSimulation

Problem Explanation

Explanation

To solve this problem, we can simulate the stack operations based on the given rules. We iterate through the numbers from 1 to n and check if the current number is in the target array. If it is, we push it onto the stack. If it's not, we push the number onto the stack and immediately pop it to simulate not using it. We continue this process until the stack matches the target array or we reach the end of the numbers from 1 to n.

Algorithm:

  1. Initialize an empty stack to store the elements.
  2. Iterate through the numbers from 1 to n:
    • If the current number is in the target array, push it onto the stack.
    • If the current number is not in the target array, push it onto the stack and immediately pop it.
    • Check if the stack matches the target array. If it does, stop the iterations.
  3. Return the stack operations as the output.

Time Complexity:

The time complexity of this algorithm is O(n), where n is the value of the input parameter n.

Space Complexity:

The space complexity of this algorithm is O(n) since the stack can potentially store all n elements.

Solution Code

class Solution {
    public List<String> buildArray(int[] target, int n) {
        List<String> result = new ArrayList<>();
        Stack<Integer> stack = new Stack<>();
        
        int index = 0;
        for (int i = 1; i <= n && index < target.length; i++) {
            stack.push(i);
            result.add("Push");
            
            if (stack.peek() != target[index]) {
                stack.pop();
                result.add("Pop");
            } else {
                index++;
            }
        }
        
        return result;
    }
}

Try It Yourself

Loading code editor...

Related LeetCode Problems

Frequently Asked Questions

How to solve LeetCode 1441 (Build an Array With Stack Operations)?

This page provides optimized solutions for LeetCode problem 1441 (Build an Array With Stack Operations) 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 1441 (Build an Array With Stack Operations)?

The time complexity for LeetCode 1441 (Build an Array With Stack Operations) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 1441 on DevExCode?

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

Back to LeetCode Solutions