#include <iostream>
#include <stdio.h>
#include <string>
#include <conio.h>
 
/**
* cstdio是將stdio.h的內容用C++標頭檔案的形式表示出來。
*stdio.h是C標準函式庫中的標頭檔案，即：standard buffered input&output。
*提供基本的文字的輸入輸出流操作（包括螢幕和檔案等）。                                                                   
*/
 
/**
*conio是Console Input/Output（控制檯輸入輸出）的簡寫，其中定義了通過控制檯進行資料輸入和資料輸出的函式，
*主要是一些使用者通過按鍵盤產生的對應操作，比如getch()()函式等等。                                                       
*/
 
using namespace std;
 
struct node
{
	int data;
	node *next;
};
// 建立單鏈表
node *creat()
{
	node *head, *p;
	head = new node;
	p = head;
	
	int x, cycle = 1;
	while (cycle)
	{
		cout << "Please input the data for single linker : ";
		cin >> x;
 
		if (x != 0)
		{
			node *s = new node;
			s->data = x;
			cout << "Input data : " << x << endl;
 
			p->next = s;
			p = s;
		} 
		else
		{
			cycle = 0;
			cout << "Input done! " << endl;
		}
	}
 
	head = head->next;
	p->next = NULL;
	//cout << "\nFirst data of single linker is " << head->data << endl;
	
	return head;
}
 
// 單鏈表測長
int length(node *head)
{
	int n   = 0;
	node *p = head;
 
	while (p != NULL)
	{
		p = p->next;
		n++;
	}
 
	return n;
}
 
// 單鏈表列印
void printL(node *head)
{
	node *p = head;
 
	while(p != NULL)
	{
		cout << "Single Linker data is " << p->data << endl;
		p = p->next;
	}
}
 
// 單鏈表插入
node *insert(node *head, int num)
{
	node *p0, *p1, *p2;
	p1 = head;
 
	p2 = new node;
	p0 = new node; // 插入節點
	p0->data = num;// 插入資料
 
	while (p0->data > p1->data && p1->next != NULL)
	{
		p2 = p1;
		p1 = p1->next;// p0,p1和p2位置: p2->p1->p0
	}
 
	if (p0->data <= p1->data)
	{
		if (p1 == head)
		{// 頭部前段插入 p0和p1位置: p0->p1->...
			head = p0;
			p0->next = p1;		
		} 
		else
		{// 插入中間節點 p0,p1和p2位置: p2-> p0 -> p1
			p2->next = p0;
			p0->next = p1;
		}
	} 
	else
	{   // 尾部插入節點 p0,p1和p2位置: p2->p1->p0->NULL
		p1->next = p0;
		p0->next = NULL;
	}
	return head;
}
 
// 單鏈表刪除
node *del(node *head, int num)
{
	node *p1, *p2;
	p2 = new node;
	p1 = head;
 
	while (num != p1->data && p1->next != NULL)
	{
		p2 = p1;
		p1 = p1->next;// p1和p2位置: p2->p1		
	}
 
	if (num == p1->data)
	{
		if (p1 == head)// 刪除頭節點
		{
			head = p1->next;
			delete p1;
		} 
		else
		{
			p2->next = p1->next;
			delete p1;
		}
	} 
	else
	{
		cout << num << " could not been found in the current single linker!" << endl;
	}
	return head;
}
 
 
int main()
{
	cout << "***建立單鏈表***" << endl;
	node *head = creat();
	cout << endl;
 
	cout << "***計算連結串列長***" << endl;
	int n = length(head);
	cout << "The length of input single linker is " << n << "." << endl;
	cout << endl;
 
	cout << "***列印單鏈表***" << endl;
	printL(head);
	cout << endl;
 
	cout << "****插入節點****" << endl;
	cout << "Please input the data for inserting operate : ";
	int inData;
	cin >> inData;
	head = insert(head,inData);
	printL(head);
	cout << endl;
 
	cout << "****刪除節點****" << endl;
	cout << "Please input the data for deleting operate : ";
	int outData;
	cin >> outData;
	head = del(head, outData);
	printL(head);
	cout << endl;
 
	return 0;
}
 

1.頭節點插入和刪除結果

2.中間節點插入和刪除結果

3.尾結點插入和刪除結果