【LeetCode】剑指 Offer 31. 栈的压入、弹出序列

【LeetCode】剑指 Offer 31. 栈的压入、弹出序列

package offer;

import java.util.Stack;

public class Solution31 {
    public static void main(String[] args) {
        int[] pushed = {1,2,3,4,5};
        int[] popped = {4,5,3,2,1};
        Solution31 solution = new Solution31();
        System.out.println(solution.method(pushed, popped));
    }

    private boolean method(int[] pushed, int[] popped){
        int i = 0;
        Stack<Integer> stack = new Stack<>();
        for(int num : pushed){
            stack.push(num);
            while(!stack.isEmpty() && stack.peek() == popped[i]){
                stack.pop();
                i++;
            }
        }
        return stack.isEmpty();
    }
}

//时间复杂度为 O(n)
//空间复杂度为 O(n)