实验二

1. #ifndef SeqStack_H

#define SeqStack_H

const int StackSize=10;

template<class DataType>

class SeqStack

{

public:

       SeqStack()

       {top=-1;}

       ~SeqStack(){}

       voidPush(DataType x);

       DataTypePop();

       DataTypeGetTop();

       intEmpty();

private:

       DataTypedata[StackSize];

       inttop;

};

#endif

 

#include"SeqStack.h"

 

template<class DataType>

voidSeqStack<DataType>::Push(DataType x)

{if(top==StackSize-1)throw"上溢";

data[top]=++x;

}

 

template<class DataType>

DataType SeqStack<DataType>::Pop()

{

       DataTypex;

       if(top==-1)throw"下溢";

       x=data[top--];

       returnx;

}

 

template<class DataType>

DataType SeqStack<DataType>::GetTop()

{

       if(top!=-1)

              returndata[top];

}

 

template<class DataType>

int SeqStack<DataType>::Empty()

{

       if(top==-1)return1;

       elsereturn 0;

}

 

#include<iostream.h>

#include"SeqStack.cpp"

void main()

{

       SeqStack<int>S;

       if(S.Empty())

              cout<<"栈为空"<<endl;

       else

              cout<<"栈非空"<<endl;

       cout<<"对1和2执行入栈成操作"<<endl;

       S.Push(1);

       S.Push(2);

       cout<<"栈顶元素为："<<endl;

       cout<<S.GetTop()<<endl;

       cout<<"执行一次出栈操作"<<endl;

       S.Pop();

       cout<<"栈顶元素为："<<endl;

       cout<<S.GetTop()<<endl;

}

 

 

2. #ifndef LinkQueue_H

#define LineQueue_H

template<class DataType>

struct Node

{

       DataTypedata;

       Node<DataType>*next;

};

 

template<class DataType>

class LinkQueue

{

       public:

              LinkQueue();

              ~LinkQueue();

              voidEnQueue(DataType x);

              DataTypeDeQueue();

              DataTypeGetQueue();

              intEmpty();

       private:

              Node<DataType>*front,*rear;

};

#endif;

 

#include"LinkQueue.h"

template<class DataType>

LinkQueue<DataType>::LinkQueue()

{

       Node<DataType>*s=NULL;

       s=newNode<DataType>;

       s->next=NULL;

       front=rear=s;

}

 

template<class DataType>

LinkQueue<DataType>::~LinkQueue()

{

       Node<DataType>*p=NULL;

       while(front!=NULL)

       {

              p=front->next;

              deletefront;

              front=p;

       }

}

 

template<class DataType>

voidLinkQueue<DataType>::EnQueue(DataType x)

{

       Node<DataType>*s=NULL;

       s=newNode<DataType>;

       s->data=x;

       s->next=NULL;

       rear->next=s;rear=s;

}

 

template<class DataType>

DataTypeLinkQueue<DataType>::DeQueue()

{

       Node<DataType>*p=NULL;

       intx;

       if(rear==front)throw"下溢";

       p=front->next;

       x=p->data;

       front->next=p->next;

       if(p->next==NULL)rear=front;

       deletep;

       returnx;

}

 

template<class DataType>

DataTypeLinkQueue<DataType>::GetQueue()

{

       if(front!=rear)

              returnfront->next->data;

}

 

template<class DataType>

int LinkQueue<DataType>::Empty()

{

       if(front==rear)

              return1;

       else

              return0;

}

 

#include<iostream>

using namespace std;

#include"LinkQueue.cpp"

 

void main()

{

       LinkQueue<int>.Q;

       if(Q.Empty())

              cout<<"队列为空"<<endl;

       else

              cout<<"队列非空"<<endl;

       cout<<"元素1和2执行入队操作:"<<endl;

       try

       {

              Q.EnQueue(1);

              Q.EnQueue(2);

       }

       catch(char* wrong)

       {

              cout<<wrong<<endl;;

       }

       cout<<"查看队头元素:"<<endl;

       cout<<Q.GetQueue()<<endl;

 

       cout<<"执行出队操作:"<<endl;

       try

       {

              Q.DeQueue();

       }

 

       catch(char* wrong)

       {

              cout<<wrong<<endl;;

       }

       cout<<"查看队头元素:"<<endl;

       cout<<Q.GetQueue()<<endl;

 

 

3.

#include <stdio.h>

int main()

{

        int n,a[100],i=0,j;

        scanf("%d",&n);

        while(n)

        {

          a[i++]=n%2;

              n/=2;

        }

        for(j=i-1;j>=0;j--)

         printf("%d",a[j]);

        printf("\n");

        return 0;

}