摘要： 1 #include 2 #include 3 using namespace std; 4 5 class QueuebyStack 6 { 7 public: 8 void enqueue(char ch) 9 {10 s1.push(ch);11 ... 阅读全文

摘要： Node* findMid(Node* &head){ if(head == NULL||head->next == NULL) return head; Node* p = head; Node* q = head; while(q->next->ne... 阅读全文

摘要： #include using namespace std;struct Node{ Node *next; int elem;};void creatList(Node* &head){ head = new Node; int elem; cin>>elem; ... 阅读全文