LintCode-翻转链表

翻转链表

翻转一个链表

样例

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

挑战

在原地一次翻转完成

通过三个链表指向，依次轮转。完成原地一次翻转。

/**
 * Definition for ListNode.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int val) {
 *         this.val = val;
 *         this.next = null;
 *     }
 * }
 */ 
public class Solution {
    /**
     * @param head: The head of linked list.
     * @return: The new head of reversed linked list.
     */
    public ListNode reverse(ListNode head) {
		 ListNode change = null,save = null;
		 while(head != null){
			 save = head.next;
			 head.next = change;
			 change = head;
			 head = save;
			 if(save == null){
				 break;
			 }
		 }
		 return change;
	    }
}