Leetcode
2020.04.08 17:55

946. Validate Stack Sequences

조회 수 94 추천 수 0 댓글 0
?

단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄
?

단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄

Given two sequences pushed and popped with distinct values, return true if and only if this could have been the result of a sequence of push and pop operations on an initially empty stack.

 

Example 1:

Input: pushed = [1,2,3,4,5], popped = [4,5,3,2,1]
Output: true
Explanation: We might do the following sequence:
push(1), push(2), push(3), push(4), pop() -> 4,
push(5), pop() -> 5, pop() -> 3, pop() -> 2, pop() -> 1

Example 2:

Input: pushed = [1,2,3,4,5], popped = [4,3,5,1,2]
Output: false
Explanation: 1 cannot be popped before 2.

 

Note:

  1. 0 <= pushed.length == popped.length <= 1000
  2. 0 <= pushed[i], popped[i] < 1000
  3. pushed is a permutation of popped.
  4. pushed and popped have distinct values.


class Solution {
    public boolean validateStackSequences(int[] pushed, int[] popped) {
        int loop = pushed.length;
        Stack<Integer> stack = new Stack();

        int index = 0;
        //for (int x: pushed) {
        for(int i=0; i<loop; i++){
            //stack.push(x);
            stack.push(pushed[i]);
            while (!stack.isEmpty() && index < loop && stack.peek() == popped[index]) {
                stack.pop();
                index++;
            }
        }

        return index == loop;
    }
}


class Solution {
    public boolean validateStackSequences(int[] pushed, int[] popped) {
        int loop = pushed.length;
        int[] stack = new int[loop];
        int peek = -1;
        
        int curr = 0;
        for(int i=0; i<loop; i++){
            stack[++peek] = pushed[i];
            
            while(peek > -1 && curr < loop && stack[peek] == popped[curr]){
                peek--;
                curr++;
            }
        }
        
        return curr == loop;
    }
}


[문제] https://leetcode.com/problems/validate-stack-sequences/



?

List of Articles
번호 분류 제목 글쓴이 날짜 조회 수
77 Programmers hashmap secret hooni 2020.04.30 0
76 Programmers fib secret hooni 2020.04.30 0
75 Programmers team game secret hooni 2020.04.30 0
74 Leetcode 692. Top K Frequent Words hooni 2020.04.15 80
73 Leetcode 2. Add Two Numbers hooni 2020.04.14 83
72 Leetcode 731. My Calendar II hooni 2020.04.15 87
71 Leetcode 75. Sort Colors hooni 2020.04.14 88
70 Leetcode 347. Top K Frequent Elements hooni 2020.04.14 89
69 Leetcode 20. Valid Parentheses hooni 2020.04.25 89
68 Leetcode 430. Flatten a Multilevel Doubly Linked List file hooni 2020.04.06 91
67 Leetcode 23. Merge k Sorted Lists hooni 2020.04.14 91
66 Leetcode 729. My Calendar I hooni 2020.04.15 91
65 Leetcode 253. Meeting Rooms II hooni 2020.04.15 91
64 Leetcode 7. Reverse Integer hooni 2020.04.28 91
63 Leetcode 62. Unique Paths file hooni 2020.04.09 92
62 Leetcode 350. Intersection of Two Arrays II hooni 2020.04.28 92
61 Leetcode 852. Peak Index in a Mountain Array hooni 2020.04.28 92
» Leetcode 946. Validate Stack Sequences hooni 2020.04.08 94
59 Leetcode 973. K Closest Points to Origin hooni 2020.04.15 94
58 Leetcode 443. String Compression hooni 2020.04.25 94
Board Pagination Prev 1 2 3 4 Next
/ 4