데이터 구조 스 택 의 응용

#include<iostream>
#include "d://SeqStack.cpp"
using namespace std;
void f(int num,int radix)
{
    int m;
    SeqStack stack;
    stack.initStack();
  while(num/radix!=0)
  {
      m=num%radix;
      stack.Push(m);//  
      num=num/radix;
  }
  m=num%radix;
stack.Push(m);
stack.visit();
}
int main()
{
    int num,radix;
cout<<"          ：";
cin>>num;
cout<<endl<<"          ：";
cin>>radix;
cout<<endl<<num<<"   "<<radix<<"    ";
f(num,radix);
return 0;
}

#include<iostream>
using namespace std;
#include"  .cpp"
int match(char exp[],int n)
{
  int i=0;
  int mat=1;
  linkStack *stack=initStack();
  while(i<n&&mat)
  {
    switch (exp[i])
    {
      case '(':
      case '[':
      case '{':
      case '<':
         {
          stack=push(stack,exp[i]);
          cout<<"  ："<<exp[i]<<endl;
          i++;
         }
         break;
      case ')':
          {
           if(!isEmpty(stack)&&getTop(stack)=='(')
           {
            cout<<"  ：";
            stack=pop(stack);
            i++;
           }
           else mat=0;
          }
          break;
      case ']':
          {
           if(!isEmpty(stack)&&getTop(stack)=='[')
           {
            stack=pop(stack);
            i++;
           }
           else mat=0;
          }
           break;
      case '}':
          {
           if(!isEmpty(stack)&&getTop(stack)=='{')
           {
            stack=pop(stack);
            i++;
           }
           else mat=0;
          }
          break;
      case '>':
          {
           if(!isEmpty(stack)&&getTop(stack)=='<')
           {
            stack=pop(stack);
            i++;
           }
           else mat=0;
          }
           break;
      default:break;
        
    }
  }
return mat;
}
int  main()
{
    char exp[]={'[','(','}'};
    cout<<match(exp,2);
return 0;
}

#include<iostream>
using namespace std;
void sympthy(char str[])
{
 int i,j,n; 
 n=strlen(str);
 char temp[50];
 //           
 for(j=0;j<n/2;j++)
 {
  temp[j]=str[j];
 }
 
 //            
 if(n%2==0)i=j;
 else i=j+1;j=j-1;
 //         
 while(i<n&&str[i]==temp[j])
 {
  i++;
  j--;
 }
 if(i==n)
   cout<<"   !!!";
 else
	 cout<<"    !!!";
 

}
int main()
{
	char str[]="qwertyuytrewq";
	sympthy(str);
 return 0;
}