#include <iostream>
#include <ctime>
#include <stdlib.h>
#include <random>

#include <time.h>
#include <stdlib.h>
#include <sys/types.h>
#include <sys/msg.h>
#include <sys/ipc.h>
#include <sys/wait.h>
#include <stdio.h>
#include <unistd.h>
#include <stdlib.h>
#include <stdbool.h>
#include <malloc.h>

struct Hello{
	void sayHello(char *name){
		printf("你好，%s\n",name);
	}
};

int main()
{
	Hello hello;
	hello.sayHello();
	exit(0);
}

struct Hello{
	void (*sayHello)(char* name);   //函數(shù)名為指針類型
};
void sayHello(char* name){
	printf("你好，%s\n",name);
}
int main(){
	struct Hello hello;  //聲明結(jié)構(gòu)體的變量，需要加struct
	hello.sayHello=sayHello;  //C語言需要使用函數(shù)指針指向函數(shù)的聲明?。?！
	hello.sayHello("淺若清風(fēng)");
	return 0;
}

void f()
{
	int n;
	int m;
	int *Array1;  //聲明一維動態(tài)數(shù)組
	Array1=new int(n);  //為一維動態(tài)數(shù)組分配空間，元素個數(shù)為n
	int **Array2;  //聲明二維動態(tài)數(shù)組
	Array2=new int*[n];  //為二維動態(tài)數(shù)組分配空間（n個指針空間），n行
	for(int i;i<n;++i)
	{
		Array2[i]=new int[m];  //為每一行分配內(nèi)存空間（m個整數(shù)空間），m列
	}
	//釋放內(nèi)存
	delete []Array1;
	for(int i=0;i<n;++i){
		delete[]Array2[i];
	}
	delete[]Array2;
}

void f()
{
	int n;
	int m;
	int *Array1;  //聲明一維動態(tài)數(shù)組
	Array1=(int *)calloc(n,sizeof(int));  //為一維動態(tài)數(shù)組分配空間，元素個數(shù)為n
	int **Array2;  //聲明二維動態(tài)數(shù)組
	Array2=(int **)calloc(n,sizeof(int*));  //為二維動態(tài)數(shù)組分配空間（n個指針空間），n行
	for(int i;i<n;++i)
	{
		Array2[i]=(int*)calloc(m,sizeof(int));  //為每一行分配內(nèi)存空間（m個整數(shù)空間），m列
	}
	//釋放內(nèi)存
	free(Array1);
	for(int i=0;i<n;++i){
		free(Array2[i]);
	}
	free(Array2);
}

#include<iostream>
using namespace std;

class QueueNode  //隊列結(jié)點
{
public:
	QueueNode() :page(-1), next(NULL) {};
	QueueNode(int m_page, QueueNode* m_next = NULL) :page(m_page), next(m_next) {};
	~QueueNode() { next = NULL; }
public:
	int page;
	QueueNode* next;  //儲存下一個結(jié)點的指針
};

class LinkQueue  //隊列
{
public:
	LinkQueue() { front = rear = new QueueNode(); count = 0; }
	void push(int m_page);  //加到隊尾
	int pop();  //取出隊首結(jié)點（此例是包含頭指針的鏈隊，頭指針的下一個結(jié)點才是隊首結(jié)點），并返回該結(jié)點值
	bool exist(int page);  //判斷隊列中是否有結(jié)點的值為page
	void print(int page);  //打印隊列

	QueueNode* front;  //隊首指針
	QueueNode* rear;  //隊尾指針
	int count;  //統(tǒng)計結(jié)點數(shù)量
};

void LinkQueue::push(int m_page)
{
	QueueNode* p = new QueueNode(m_page);
	p->next = NULL;
	rear->next = p;
	rear = p;
	count++;
}

int LinkQueue::pop()
{
	if (front == rear) {
		printf("隊列為空！\n");
		return 0;
	}
	int top = front->next->page;  //記錄隊首，作為返回值
	QueueNode* tmp = front->next;
	front->next = tmp->next;
	if (rear == tmp)  //只剩下一個元素，此題不會出現(xiàn)這種情況
	{
		rear = front;
	}
	delete tmp;
	count--;
	return top;
}

void LinkQueue::print()  //打印隊列
{
	QueueNode* p = front;
	while (p->next != NULL)
	{
			printf("%d ", p->next->page);
			p = p->next;
	}
	printf("\n");
}

bool LinkQueue::exist(int page) {  //判斷隊列中是否存在元素page
	QueueNode*p = front;
	while (p->next != NULL) {
		if (p->next->page == page) {
			return true;
		}
		else {
			p = p->next;
		}
	}
	return false;
}

int main()
{
	LinkQueue queue;
	for(int i=0;i<5;++i)
	{
		queue.push(i);
	}
	queue.print();
	if(queue.exit(6)) printf("yes!\n");
	else printf("no!\n");
	int top=queue.pop();  //獲得隊首元素值
	printf("隊首元素的值為%d\n",top);
}

# include<stdio.h>
# include<stdlib.h>
# include<stdbool.h>

struct QueueNode
{
	int page;
	struct QueueNode *next;
};

typedef struct LinkQueue {
	struct QueueNode* front;
	struct QueueNode* rear;
	int count;
};

void initQueue(struct LinkQueue *q)
{
	q->front = q->rear=(struct QueueNode *)malloc(sizeof(struct QueueNode));
	q->front->next = NULL;
	q->count=0;
}

void push(struct LinkQueue *q, int page)
{
	struct QueueNode* node = (struct QueueNode*)malloc(sizeof(struct QueueNode));
	node->next = NULL;
	node->page = page;
	q->rear->next = node;  //與新增結(jié)點鏈接
	q->rear=node;  //尾指針后移
	q->count++;
}

int pop(struct LinkQueue*q)  //隊首元素出隊，并返回數(shù)值
{
	int top = q->front->next->page;
	struct QueueNode *node = q->front->next;
	q->front->next = q->front->next->next;
	free(node);
	return top;
}

bool exist(struct LinkQueue*q, int page)  //判斷隊列是否有結(jié)點的值等于page
{
	struct QueueNode *node = q->front;
	while (node->next != NULL)
	{
		if (node->next->page == page) return true;
		else node = node->next;
	}
	return false;
}

void print(struct LinkQueue *q)
{	
	struct QueueNode *node =q->front;
	while (node->next != NULL)
	{
		printf("%d ", node->next->page);
		node = node->next;
	}
	printf("\n");
}

int main()
{
	struct LinkQueue queue;
	initQueue(&queue);
	for (int i = 1; i < 5; ++i)
	{
		push(&queue, i);
	}
	print(&queue);
	if (exist(&queue, 3)) printf("yes!\n");
	printf("======\n");
	if (exist(&queue, 6)) printf("yes!\n");
	else printf("no!\n");
	int top = pop(&queue);
	printf("隊首元素的值為%d\n", top);
}