题目描述
输入两个整数序列,第一个序列表示栈的压入顺序,请判断第二个序列是否可能为该栈的弹出顺序。假设压入栈的所有数字均不相等。例如序列1,2,3,4,5是某栈的压入顺序,序列4,5,3,2,1是该压栈序列对应的一个弹出序列,但4,3,5,1,2就不可能是该压栈序列的弹出序列。(注意:这两个序列的长度是相等的)
思路:
1.依次将数组A中元素加入stack
2.while循环判断
- stack不为空,stack的头元素如果等于 数组B的j处元素,则一直弹栈
方式一:
class Solution {
public boolean validateStackSequences(int[] arr1, int[] arr2) {
if (arr1 == null || arr2 == null) {
return false;
}
if (arr1.length != arr2.length) {
return false;
}
Stack<Integer> stack = new Stack<>();
int j = 0;
for (int i = 0; i < arr1.length; i++) {
stack.add(arr1[i]);
while (stack.size() > 0 && stack.peek() == arr2[j]) {
stack.pop();
j++;
}
}
return stack.isEmpty();
}
}
方式二:
- 先对数组A进行add压栈,直到到和数组B 索引 j = 0处相同的元素为止
- 然后pop掉头元素
- 此时如果stack为空了,则递归
- while循环,peek:如果相同,则pop,如果不相同则add
class Solution {
public boolean validateStackSequences(int[] arr1, int[] arr2) {
if (arr1 == null || arr2 == null) {
return false;
}
if (arr1.length != arr2.length) {
return false;
}
if (arr1.length == 1) {
return arr1[0] == arr2[0];
}
if (arr1.length == 2) {
return (arr1[0] == arr2[0] && arr1[1] == arr2[1]
|| arr1[0] == arr2[1] && arr1[1] == arr2[0]);
}
int len = arr1.length;
Stack<Integer> stack = new Stack<>();
int i= 0;
while (i< len) {
int pushVal = arr1[i];
stack.add(pushVal);
i++;
if (pushVal == arr2[0]) {
break;
}
}
stack.pop();
if (stack.isEmpty()) {
return validateStackSequences(Arrays.copyOfRange(arr1, i, len), Arrays.copyOfRange(arr2, i, len));
}
int j= 1;
while (j< len) {
if (stack.isEmpty()) {
return validateStackSequences(Arrays.copyOfRange(arr1, i, len),
Arrays.copyOfRange(arr2, i, len));
}
Integer peek = stack.peek();
if (Objects.equals(peek, arr2[j])) {
stack.pop();
j++;
} else {
if (i >= len) {
break;
}
stack.add(arr1[i]);
i++;
}
}
return stack.isEmpty();
}
}