0.code
class Solution {
public boolean validateStackSequences(int[] pushed, int[] popped) {
Stack<Integer> stack = new Stack<>();
if(pushed.length!=popped.length){
return false;
}
int pushLen = pushed.length;
int popLen = popped.length;
int j=0;
for(int i=0;i<pushLen;i++){
stack.push(pushed[i]);
while(!stack.empty()&&stack.peek()==popped[j]){
stack.pop();
j++;
}
}
if(j==popLen&&stack.empty()){
return true;
}
return false;
}
}
