翻转一个链表
样例
给出一个链表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) {
// write your code here
if(head==null)
return null;
ListNode dummy=new ListNode(0);
dummy.next=head;
ListNode preNode=dummy.next;
ListNode node2=dummy.next.next;
while(node2!=null){
ListNode node=node2;
preNode.next=node2.next;
node2=node2.next;
node.next=dummy.next;
dummy.next=node;
}
return dummy.next;
}
}