stack.cpp

单链表倒序

#include <stdio.h>
#define maxlength 200

int main(void)
{
	int array[maxlength][2] = {0};
	int index[3] = {0};
	int n, t, num;
	
	printf("程序说明：本程序将把小于等于10的整数,大于100的整数,以及以上两者之间的数分别放入三个栈中并依次输出\n");
	printf("请输入您要输入数的个数： ");
	scanf("%d", &n);
	printf("依次输入你要输入的整数:  ");
	
	for(t = 0; t < n; t++)
	{
		if(array[maxlength - 1][1] != 0)
			{
				printf("full\n");
		        break; 
		}
		scanf("%d", &num);
		if(num <= 10)
		{
			array[t][0] = num;
			array[t][1] = index[0];
			index[0] = t + 1;
		}
		else if(num <= 100)
		{
			array[t][0] = num;
			array[t][1] = index[1];
			index[1] = t + 1;
		}
		else
		{
			array[t][0] = num;
			array[t][1] = index[2];
			index[2] = t + 1;
		}
	}
	for(t = 0; t < 3; t++)
	{
		printf("第 %d 个栈: ", t + 1);
		while(index[t] != 0)
	    {
			printf("%d   ", array[index[t] - 1][0]);
	        index[t] = array[index[t] - 1][1];
	    }
		printf("\n");
	}
	
	return 0;
}