实现单链表的逆置

#include <iostream>
using namespace std;

typedef int elem;

struct Node{
    elem n;
    struct Node * next;
};

//创建
Node* Create_link(){
    Node* root = new Node;
    if(root==NULL) return NULL;
    
    root->n = 1;
    root->next = NULL;
    
    Node* temp = root;
    
    for(int i=2;i<=5;i++){
        Node* p = new Node;
        p->n = i;
        p->next = NULL;
        
        temp->next = p;
        temp = temp->next; 
    } 
    //delete temp;
    return root;
} 

//逆置
Node* Reversal(Node* head){
    Node *prev = NULL;
    Node *next = NULL;
    
    while(head){
        next = head->next;
        head->next = prev;
        prev = head;
        head = next;
    }
    return prev;
} 

//打印
void Print(Node* n){
    Node* temp = n;
    while(temp!=NULL){
        cout<<temp->n<<' ';
        temp = temp->next;
    }
    cout<<'
';
} 
int main(){
    Node* L = Create_link();
    Print(L);//逆置前
    Node* R = Reversal(L);
    Print(R);//逆置后
    return 0;
} 

 转自：https://blog.csdn.net/baidu_31945865/article/details/88361680