﻿ C语言数据结构 link 链表反转的实现 - 鸿网互联

C语言数据结构 link 链表反转的实现 链表反转，示例如下： 偶数个输入：a-b-c-d-e-f 偶数个输出：e-f-c-d-a-b or 奇数个输入：a-b-c-d-e-f-g 偶数个输出：g-e-f-c-d-a-b #include stdio.h #include malloc.h #include stdlib.h /************** start of sta

or

```#include <stdio.h>
#include <malloc.h>
#include <stdlib.h>

/************** start of stack *************/

#define STACK_SIZE 1024

char stack[STACK_SIZE];
int top = 0;

void push(char ch){
stack[top] = ch;
top++;
}

char pop(){
top--;
return stack[top];
}

int isempty(){
return 0 == top;
}

void test_stack(){
push('a');
push('b');
push('c');
push('d');

while(!isempty()){
printf("pop ch: %c\n", pop());
}
}

/************** end of stack *************/

struct _node{
char data;
struct _node *next;
};

// check malloc success or not
if(NULL == pl) {
printf("malloc memory fail...");
return NULL;
}

pl->data = '\0';
pl->next = NULL;

return pl;
}

while(p->next){
p = p->next;
}

node = (plink)malloc(sizeof(node));   // malloc a new node

if(NULL != node){
node->data = data;
node->next = p->next;    // last next is NULL
p->next = node;
p = node;          // p point last node
}
}

if(NULL == pl){
return;
}

plink p = pl->next;  // already check pl is NULL, so here is ok
while(NULL != p){
printf("%c -> ", p->data);
p = p->next;
}
printf("\n\n");
}

// push and pop stack

while(p->next){
//    printf("p->data: %c\n", p->next->data);
if(p->next->next){
push(p->next->next->data);
push(p->next->data);
p = p->next->next;
} else {
push(p->next->data);
p = p->next;
}
}

while(!isempty()){
printf("%c -> ", pop());
}

printf("\n\n");

return NULL;
}

if(NULL == pl){  // check link is NULL
return NULL;
}

tmp_pl = tmp_pl->next;
}

// link length is no more than two node(s)
return pl;
}

// link length is more than two nodes
}

int main(){

input_data(pl, 'b');
input_data(pl, 'c');
input_data(pl, 'd');
input_data(pl, 'e');
input_data(pl, 'f');
input_data(pl, 'g');

return 0;
}

/****

linux gcc compile

output result:

a -> b -> c -> d -> e -> f -> g
g -> e -> f -> c -> d -> a -> b

or

a -> b -> c -> d -> e -> f
e -> f -> c -> d -> a -> b

****/

```

```plink revert_link3(plink pl){
if(NULL == pl){
return NULL;
}

while(NULL != first){
if(NULL != second){
first->next = second->next;   // third node
second->next = first;      // revert two nodes
first = first->next;
p->next = second;
p = second->next;
}
}
return pl;
}

```

<