01-03

1. 利用模板类完成顺序表

   #include <iostream>
   #include <cstdlib>
   using namespace std;
   #define MAXSIZE 10
   template<typename T>
   class S
   {
       T data[MAXSIZE]={0};
       int len;
   public:
       S():len(0){}
       int insert_rear(T element)
       {
           if(len==MAXSIZE)
           {
               return -1;
           }
           data[len++]=element;
           cout<<len<<endl;
           return 0;
       }
       int delete_rear()
       {
           len--;
           return 0;
       }
       int reserch(T element)
       {
           for (int i=0;i<len;i++)
           {
               if(data[i]==element)
               {
                   return i;
               }
           }
           return -1;
       }
       void show()
       {
           for (int i=0;i<len;i++)
           {
               cout<<data[i]<<"\t";
           }
           cout<<endl;
       }
   };
   
   int main()
   {
       S<int> list;
       for (int i=0;i<MAXSIZE-1;i++)
       {
           list.insert_rear(i);
       }
       list.show();
       list.delete_rear();
       list.show();
       cout<<"num:"<<list.reserch(5)<<endl;
       return 0;
   }