哎呀,糟了,leetcode又有easy题了,好久没上,直接在网站上A了。题目就是把一个链表倒过来。。。
public ListNode reverseList(ListNode head) { if(head == null)return null; ListNode preNode = null; ListNode curNode = head; ListNode nxtNode = head.next; while(curNode != null){ curNode.next = preNode; preNode = curNode; curNode = nxtNode; if(curNode!=null){ nxtNode = curNode.next; }else{ break; } } return preNode; }
leetcode: Reverse Linked List(java)
原文地址:http://blog.csdn.net/gotobar/article/details/45500631