算法 链表 206.反转链表

---

一.题目

题意：反转一个单链表。

示例: 输入: 1->2->3->4->5->NULL 输出: 5->4->3->2->1->NULL

---

二.代码

public class ReverseList {
    public static void main(String[] args) {
        ListNode2 head = new ListNode2(1,new ListNode2(2,new ListNode2(3,new ListNode2(4,new ListNode2(5)))));
        Solution s=new Solution();
        ListNode2 rhead=s.rList(head);
        ListNode2 cur=rhead;
        while (cur!=null){
            System.out.println(cur.val);
            cur=cur.next;
        }
    }
}

class ListNode2{
    int val;
    ListNode2 next;

    public  ListNode2(int val){
        this.val=val;
        this.next=null;
    }

    public ListNode2(int val,ListNode2 next){
        this.val=val;
        this.next=next;
    }
}



class Solution {
    public ListNode2 rList(ListNode2 head) {
        ListNode2 prev = null;
        ListNode2 cur = head;
        ListNode2 temp = null;
        while (cur != null) {
            temp = cur.next;
            cur.next = prev;
            prev = cur;
            cur = temp;
        }
        return prev;
    }
}

---

三.总结

需要将cur->next节点提前先保存在temp里。