头插法反转链表——Java实现

题目：
给你单链表的头节点 head ，请你反转链表，并返回反转后的链表。
OJ链接：https://leetcode.cn/problems/reverse-linked-list/description/

解答：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode reverseList(ListNode head) {
        if(head ==  null){
            return null;
        }
        if(head != null){
            ListNode cur = new ListNode();
            cur = head.next;
            ListNode curnext = new ListNode();
            head.next = null;
            while(cur != null){
                curnext = cur.next;
                cur.next =  head;
                head = cur;
                cur = curnext;
            }
        }
        return head;
    }
}