给定 pushed 和 popped 两个序列，每个序列中的 值都不重复 ，只有当它们可能是在最初空栈上进行的推入 push 和弹出 pop 操作序列的结果时，返回 true；否则，返回 false 。
示例 1：
输入：pushed = [1,2,3,4,5], popped = [4,5,3,2,1]
输出：true
解释：我们可以按以下顺序执行：
push(1), push(2), push(3), push(4), pop() -> 4,
push(5), pop() -> 5, pop() -> 3, pop() -> 2, pop() -> 1示例 2：
输入：pushed = [1,2,3,4,5], popped = [4,3,5,1,2]
输出：false
解释：1 不能在 2 之前弹出。提示：
-
1 <= pushed.length <= 1000 -
0 <= pushed[i] <= 1000 -
pushed的所有元素 互不相同 -
popped.length == pushed.length -
popped是pushed的一个排列bool validateStackSequences(int* pushed, int pushedSize, int* popped, int poppedSize){
int* arr = (int*)malloc(sizeof(int) * pushedSize);
for(int i = 0; i < poppedSize; i++) arr[i] = 1;
int ind = 0;
for(int i = 0; i < poppedSize; i++){
while(arr[ind] == 0 || popped[i] != pushed[ind]) {
ind++;
if(ind == poppedSize) return false;
}
arr[ind] = 0;
while(ind > 0 && arr[ind] == 0) ind--;
}
return true;
}bool validateStackSequences(int* pushed, int pushedSize, int* popped, int poppedSize){
int* sta = (int*)malloc(sizeof(int) * poppedSize);
int top = -1, x = 0;
for(int i = 0; i < poppedSize; i++){
if(top == -1 || sta[top] != popped[i]){
while(x < poppedSize && pushed[x] != popped[i]){
sta[++top] = pushed[x++];
}
if(x == poppedSize) return false;
sta[++top] = pushed[x++];
}
top--;
}
return true;
}bool validateStackSequences(int* pushed, int pushedSize, int* popped, int poppedSize){
int* sta = (int*)malloc(sizeof(int) * poppedSize);
int top = -1, x = 0;
for (int i = 0; i < poppedSize; i++){
while(top == -1 || sta[top] != popped[i]){
if(x == poppedSize) return false;
sta[++top] = pushed[x++];
}
top--;
}
return true;
}