单链表反转

#import "HZReverseLinkList.h"

@implementation HZReverseLinkList

struct Node* reverseList(struct Node *head){
    // 定义遍历指针，初始化为头结点
    struct Node * p = head;
    // 反转后的链表头部
    struct Node *newH = NULL;
    
    // 遍历链表
    while(p != NULL){
        //记录遍历链表的下一个节点
        struct Node *temp = p->next;
        //当前结点的next指向新链表的头部
        p->next = newH;
        // 更改新链表头部为当前结点
        newH = p;
        // 移动p指针
        p = temp;
        
    }
    return newH;
}


struct Node* constructList(void){
    // 头结点定义
    struct Node *head = NULL;
    // 记录当前尾结点
    struct Node *cur = NULL;
    
    for(int i = 1; i < 5; i++){
        struct Node *node = malloc(sizeof(struct Node));
        node->data = i;
        node->next = NULL;
        
        //头结点为空，新结点即为头结点
        if(head == NULL){
            head = node;
        }else{
            cur->next = node;
        }
        // 设置当前结点为新节点
        cur = node;
    }
    return head;
}

void printList(struct Node *head){
    struct Node* temp = head;
    while(temp != NULL){
        printf("node is %d\n",temp->data);
        temp = temp->next;
    }
}
@end