35. 翻转链表

描述

 翻转一个链表

样例

 给出一个链表1->2->3->null，这个翻转后的链表为3->2->1->null

挑战

 在原地一次翻转完成

代码

/**
 * Definition of ListNode
 * 
 * class ListNode {
 * public:
 *     int val;
 *     ListNode *next;
 * 
 *     ListNode(int val) {
 *         this->val = val;
 *         this->next = NULL;
 *     }
 * }
 */


class Solution {
public:
    /*
     * @param head: n
     * @return: The new head of reversed linked list.
     */
    ListNode * reverse(ListNode * head) {
        // write your code here
        
        if(!head)   return head;
        
        ListNode *p = new ListNode;     p = head;
        ListNode *pt = new ListNode;    if(p)   pt = p->next;
        ListNode *tail = new ListNode;  
        
        if(pt!=NULL) { 
            tail = pt->next;    p->next=NULL;
        }else 
            return head;
            
        if(!tail) {
            head = pt;  pt->next = p; p->next = tail;
            return head;
        }
    
        while(tail)
        {
            pt->next = p;
            p = pt;
            pt = tail;
            tail = tail->next;
        }
        pt->next = p;
        head = pt;
        
        return head;
    }
};