跳转至

Chapter 2 Linear List

约 13 个字 11 行代码

2.3 其他操作

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
ListNode *reverse(ListNode *head) {
    ListNode *newHead = NULL;
    ListNode *tmp, *cur = head;
    while (head != NULL) {
        tmp = head->next;
        head->next = newHead;
        newHead = head;
        head = tmp;
    }
    return newHead;
}