LeetCode[206] Reverse Linked List

Reverse a singly 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) {ListNode *h = NULL;while (head) {ListNode *now = head;head = head->next;now->next = h;h = now;}return h;}};