单向链表反转
单向链表反转实现思路:
(1)从头节点开始,此时头节点为当前节点,反转当前节点所指向的下个节点
(2)移动当前节点到下一个节点,即下一个相邻节点为新的当前节点
(3)循环迭代上述步骤1、2,迭代次数为链表长度
参考博文链接:https://www.cnblogs.com/passedbylove/p/11442606.html
该思路演示框图如下,以链表长度为4举例说明
代码详情如下
// Iterative C program to reverse a linked list
#include <stdio.h>
#include <stdlib.h>
/* Link list node */
struct Node
{
int data;
struct Node* next;
};
/* function to reverse the linked list */
void reverse(struct Node** head_ref)
{
struct Node* prev = NULL;
struct Node* current = *head_ref;
struct Node* next = NULL;
while(current != NULL)
{
//Store next
next = current->next;
//Reverse current node's pointer
current->next = prev;
//Move pointers one position ahead.
prev = current;
current = next;
}
*head_ref = prev;
}
/* function to push a node */
void push(struct Node** head_ref, int new_data)
{
struct Node* new_node = (struct Node*)malloc(sizeof(struct Node));
new_node->data = new_data;
new_node->next = (*head_ref);
(*head_ref) = new_node;
}
/* function to print linked list */
void printList(struct Node* head)
{
struct Node* temp = head;
while(temp != NULL)
{
printf("%d ", temp->data);
temp = temp->next;
}
printf("\n");
}
/* driver program to test above function */
int main() {
/* Start with the empty list */
struct Node* head = NULL;
push(&head, 20);
push(&head, 4);
push(&head, 15);
push(&head, 85);
printf("Given linked list\n");
printList(head);
reverse(&head);
printf("Reversed linked list\n");
printList(head);
return 0;
}
程序运行结果