206. 反转链表
反转一个单链表。
示例:
输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL
Java参考解答
迭代解法
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode reverseList(ListNode head) {
ListNode cur = head;
ListNode rs = null;
ListNode tmp = null;
while(cur != null){
tmp =cur.next;
cur.next = rs;
rs = cur;
cur = tmp;
}
return rs;
}
}