Leetcode
2020.04.08 17:55

# 946. Validate Stack Sequences

조회 수 162 추천 수 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;
}
}
```

?

 제목+내용제목내용댓글이름닉네임아이디태그
List of Articles
번호 분류 제목 글쓴이 날짜 조회 수
77 Leetcode [todo] 687. Longest Univalue Path 2020.05.01 211
76 Programmers team game 2020.04.30 0
75 Programmers hashmap 2020.04.30 0
74 Programmers fib 2020.04.30 0
73 Leetcode 997. Find the Town Judge 2020.05.02 718
72 Leetcode 994. Rotting Oranges 2020.04.14 177
71 Leetcode 993. Cousins in Binary Tree 2020.04.30 222
70 Leetcode 973. K Closest Points to Origin 2020.04.15 172
» Leetcode 946. Validate Stack Sequences 2020.04.08 162
68 Leetcode 937. Reorder Data in Log Files 2020.04.25 165
67 Leetcode 897. Increasing Order Search Tree 2020.05.04 687
66 Leetcode 876. Middle of the Linked List 2020.05.04 678
65 Leetcode 872. Leaf-Similar Trees 2020.05.04 679
64 Leetcode 852. Peak Index in a Mountain Array 2020.04.28 165
63 Leetcode 844. Backspace String Compare 2020.05.05 748
62 Leetcode 783. Minimum Distance Between BST Nodes 2020.05.01 728
61 Leetcode 763. Partition Labels 2020.04.17 222
60 Leetcode 75. Sort Colors 2020.04.14 155
59 Leetcode 731. My Calendar II 2020.04.15 159
58 Leetcode 729. My Calendar I 2020.04.15 151
Board Pagination Prev 1 2 3 4 Next
/ 4