sy2_1_1.cpp

一些基本的数据结构

/*-----------------------------------------------------------------------------------*/
/*----------------2008.2.6-------------------------------------------------------------------*/
/*-------------------------------------栈的顺序操作----------------------------------------*/
#include "SStack.h"
void main()
 {
   SqStack S;
   Element e;
   Status  i ;                                                             /*状态元素*/
   int j,n;
/*---------建立一个空栈-------------*/
 i = InitSqStack (&S);                             
 printf( "InitSqlist=%d, Stacksize=%d\n",i, S.Stacksize );
 /*--------------------------------------------------------------------------------*/
/*---------插入元素------------------*/
  printf("请输入十个数据\n");
  for( j = 1; j <= 10; j++ )
	 {
	  scanf("%d",&n);
      i =push(&S, n) ;
	 }
  printf( "\nStacksize=%d\n", S.Stacksize); 
  i=SqStack_Length(&S);
  printf( "\n栈的长度=%d\n", i );
/*----------------------------------------------------------------------------------*/
/*----------删除栈顶元素-------------*/
 printf("\n删除栈顶元素\n");
 i=pop(&S,&e);
 printf("\StackDelete=%d\n删除栈顶元素是=%d\n", i,e);
 i=Top(&S,&e);
 printf( "\nStackTop=%d\n现在栈顶元素是=%d\n", i,e );
 /*-----------------------------------------------------------------------------------*/
/*----------------栈的长度--------------------*/
 i=SqStack_Length(&S);
 printf( "\n栈的长度=%d\n", i );
 i=SqStack_Length(&S);
 printf( "SqStackLength=%d\n", i );

/*------------------------------------------------*/
 /*------------------清空栈------------------------------*/
 i = Clear_SqStack(&S );
 if(i==1)  
	         printf("\n栈已清空!\n");
 else      
             printf("操作失败!\n");
 /*-------------------------------------------------------------------------------*/
 /*--------------判断是否是空----------------*/
 i = Empty_SqStack(&S);
 if(i==1)  
	        printf("\n栈为空!\n");
  else      
             printf("\n栈不空!\n");
 /*-----------------------------------------------------------------------------------*/
/*----------------栈的长度--------------------*/
 i=SqStack_Length(&S);
 printf( "栈的长度=%d\n", i );

/*--------------------------------------------------------------------------------*/
/*---------------重新插入元素------------------------*/
  printf("请重新输入十个数据\n");
  for( j = 1; j <= 10; j++ )
	 {
	  scanf("%d",&n);
      i =push(&S, n) ;
	 }
  printf( "\nStacksize=%d\n",S.Stacksize);
/*-------------------------------------------------------------------------------*/
  /*--------------判断是否是空----------------*/
 i = Empty_SqStack(&S);
 if(i==1)  
	        printf("\n栈为空!\n");
  else      
             printf("\n栈不空!\n");
/*-----------------------------------------------------------------------------------*/
/*----------------栈的长度--------------------*/
 i=SqStack_Length(&S);
 printf( "\n栈的长度=%d\n", i );

/*----------------栈顶元素-------------------------*/
 i =Top(&S,&e);
 printf( "\nStacktop=%d\n\n栈顶元素是=%d\n", i, e );

/*-----------------------------------------------------------------------------------*/
/*------------销毁栈-------------------*/
  i=Destroy_SqStack(&S );
  if(i==1)  
	        printf("栈已销毁!\n");
  else      
             printf("操作失败!\n");


 }