Leetcode 刷题之链表

reverse Linked List

206. Reverse Linked List

/** * Definition for singly-linked list. * struct ListNode { *     int val; *     ListNode *next; *     ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public:    ListNode* reverseList(ListNode* head) {        if(!head) {            return NULL;        }            ListNode* pre = NULL;        ListNode* cur = head;        while(cur != NULL) {            ListNode* net = cur->next;            cur->next = pre;            pre = cur;            cur = net;        }            return pre;    }};