算法复习之 链表反转

思路：链表反转，我这里采用的是JDK 1.7中HashMap拉链法所采用的头插法。

/*
public class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}*/

import java.util.*;

public class Solution {
    public ListNode ReverseList(ListNode head) {
        /*头插法*/
        ListNode next = null;
        ListNode pre = null;
        while(head != null) {
            next = head.next;
            head.next = pre;
            pre = head;
            head = next;
        }
        return pre;
    }
}

算法复习之 链表反转

原文：https://www.cnblogs.com/bianjunting/p/14715742.html