给定入栈顺序，输出所有可能的出栈情况，并判断给定的序列是否为正确的输出序列

#include<iostream>
#include<vector>
#include<math.h>
#include<string>
using namespace std;
#define N 5
bool isStackNum(int*a, int n)//判断是否为正确的栈输出序列
{
	int p1,p2;
	for (int i = 0; i < n; i++){
		p1 = a[i];
		p2 = a[i];
		for (int j = i + 1; j < n; j++){
			if (a[j]< a[i])
				p2=p1,p1 = a[j];
			if (p2 < p1)
				return false;
		}
	}
	return true;
}
int main()
{
	vector<int*>sample;
	int k;
	int a[N] = { 0 };
	for (int i = 0; i < pow(2,N-1); i++){
		k = i * 2 + 1;
		int ch;
		string temp = "";
		while (k > 0){
			ch = k % 2;
			temp += to_string(ch);
			k /= 2;
		}
		while (temp.length()< 5){
			temp += '0';
		}
		int count = 0;
		for (int j = N - 1; j > -1; j--){
			if (temp[j] == '1'){
				a[count++] = N-j;
			}
		}
		for (int j = 0; j < N; j+&#