0610資料鏈結-佇列

// ConsoleApplication1.cpp : 定義主控台應用程式的進入點。
//

#include "stdafx.h"
#include <iostream>
using namespace std;


class node{
public:
    int data;
    node* next;
};

class mystack{
public:
    node*head;
    mystack(){ head = new node(); head->next = NULL; }
    void push(int i);
    void list();
    void pop();
};

void mystack::push(int i)
{
    node*x = new node();
    //x->next = NULL;
    x->data = i;

    if (head->next == NULL)
    {
        head->next = x;
        return;
    }

    node*p = head;
    while (p->next != NULL)
        p = p->next;
    x->next = p->next;
    p->next = x;

}

void mystack::list(){
    if (head->next == NULL){
        cout << "empty" << endl;
        return;
    }
    node *p = head;
    while (p->next != NULL)
    {
        p = p->next;
        cout << p->data << endl;
    }

}

void mystack::pop(){

    if (head->next == NULL){
        cout << "無資料" << endl;
        return;
    }
    node*current=head;
    node*pre = NULL;

    while (current->next != NULL)
    {
        pre = current;
        current = current->next;
    }

    cout << current->data << endl;
    delete current;
    pre->next = NULL;
}

class myqueue{
public:
	node*head;
	myqueue(){ head = new node(); head->next = NULL; }
	void enqueue(int i);
	void dequeue();
};

void myqueue::enqueue(int i){
	node*x = new node();
	x->data = i;

	if (head->next == NULL)
	{
		head->next = x;
		return;
	}

	node*p = head;
	while (p->next != NULL)
		p = p->next;
	p->next = x;
}

void myqueue::dequeue(){
	if (head->next == NULL){
		cout << "無資料" << endl;
		return;
	}
	node*current = head;
	node*pre = NULL;

	if (current->next != NULL)
	{
		current = current->next;
		cout << current->data << endl;
		pre = current->next;
		head->next = pre;
		delete current;
	}
}

void  main()
{
	myqueue st1;
	st1.enqueue(1);
	st1.enqueue(2);
	st1.enqueue(3);
	st1.enqueue(4);
	st1.dequeue();
	st1.dequeue();
	st1.dequeue();
	st1.dequeue();
	st1.dequeue();
}