sy2_3.cpp

一些基本的数据结构

 /*-------------------------判断中心对称---------2008.2.6----------------------------------------*/
 #include "SStack.h"
 #include "SList.h"
 void main()
  {
    Sqlist L;
	SqStack S;
    ElemType e,init,length,c,p,q;
    ElemType location,insert,del,found;
    Status i;
    int j,n,r;
    /*------------------------------------*/                                /*创建线性表*/
    i = InitList_Sq( &L );                                      
    printf( "InitSqlist=%d,  L.length=%d,  L.listsize=%d\n\n", i, L.length, L.listsize );
	   
   i = InitSqStack (&S);                             
   printf( "InitSqlist=%d, Stacksize=%d\n",i, S.Stacksize );

    printf("Please choice InitSqlist length!\n ");
	scanf("%d",&length);
	getchar();
    printf("InitSqlist  ");
     printf("Please input char!\n ");
    for( j = 1; j <= length; j++ )
      {
        scanf("%c",&init);
        i = ListInsert_Sq( &L, j, init );
      }
    printf( "SqlistInsert=%d,  ElemType=", i );
    for( j = 1; j <= L.length; j++ )
    printf( "%c  ", L.base[j-1] );
    printf( "\nL.length=%d, L.listsize=%d\n\n", L.length, L.listsize ); 

	/*---------------------------------------*/
    n=(int)(length/2);
	printf("%d\n",n);
  
    for(j=1;j<=n;j++)
	 {
      e=L.base[j-1];
      push(&S,e);
	 }
   if(length%2==1)
			  { r=n+2; }
   else     
                r=n+1;
   for(j=r;j<=length;j++)	 
	  {
       c=L.base[j-1];
       pop(&S,&e);
	   printf("%c------------%c\n",c,e);
       if(c!=e)     
				 {
		              printf("Not balance\n"); 
					  break;
				}
	   
      if(j==length)  
				 {
					 printf("Balance\n");
				 }
	  }
  


 }