链表-Reverse Linked List

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* reverseList(struct ListNode* head) {
    if(!head||!head->next)
        return head;
    struct ListNode *cur=head;
    struct ListNode *tail=head;
    while(tail->next)
        tail=tail->next;
    while(cur!=tail)
    {
        head=cur->next;
        cur->next=tail->next;
        tail->next=cur;
        cur=head;
    }
    return head;
}