栈的案例：用数组判断“1”“0”进和出栈是否合法

#include<iostream>
#define N 100

using namespace std;

bool judge(int m[],int k) {
	if (m == NULL|| (k%2)!=0) {
		return false;
	}
	int flag1=0;
	
	if (m[0] == 1) {
		flag1++;
	}
	
	for (int i = 1; i <k; i++) {
		if (m[i] == 1 ){
			flag1++;
		}
		else {
			if (flag1 <= 0) {
				return false;
			}
			flag1--;
		}

	}
	if (flag1 > 0) {
		return false;
	}
	return true;

}
int main() {
	int m[N];
	int n;
	cout << "请输入你要输入数据的个数:" << endl;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cout << "第" << i + 1 << "个数据为：" << endl;
		cin >> m[i];
	}
	int k = sizeof(m) / sizeof(m[0]);
	cout << judge(m,k);

}
``