表、栈、队列联系

3.3通过只调整指针（而不是数据）来交换两个相邻的元素——单链表实现

`#include
using namespace std;

typedef struct Node {
int number;
Node* next;
}Node;

//初始化单链表
Node* initNode() {
Node* first = new Node();
if (first == NULL) {
cout << “链表初始化失败”;
exit(-1);
}
first->next = NULL;
return first;
}
//头插法赋值
void headAddNode(int number, Node* first) {
Node* temp = new Node();
if (temp == NULL) {
cout << “链表初始化失败”;
exit(-1);
}
else {
temp->number = number;
temp->next = first->next;
first->next = temp;
}
}
void putValue(Node* first) {
Node* temp = first;
while (temp->next != NULL) {
temp = temp->next;
cout << temp->number;
}
}
//和后一个位置交换
void PrintLots(int number, Node* first) {
Node* temp = first;
//把不成立的条件放在复杂的循环中
while (temp->next != NULL&&temp->next->number != number) {
temp = temp->next;
}
if (temp->next->next == NULL) {
cout << “该元素不存在后一个元素”;
exit(-1);
}
Node* p1,* p2;
p1 = temp->next;
p2 = p1->next;
p1->next = p2->next;
temp->next = p2;
p2->next = p1;
}

int main() {
Node* l = initNode();
for (int i = 0; i < 10; i++) {
headAddNode(i, l);
}

PrintLots(0, l);
putValue(l);
int k;
cin >> k;
return 0;

}`