#include <iostream>
using std::cout;
using std::endl;
struct Node
{
int data;
struct Node * next;
struct Node * pre;
};
一、创建双向链表
Node * createList()
{
Node * head = new Node;
if (NULL == head)
exit(-1);
head->next = head;
head->pre = head;
return head;
}
二、插入元素(头插法)
让新来的节点先有所指
void insertList(Node * head,int n)
{
Node * cur = new