LeetCode-206 Reverse Linked List Solution (with Java)

1. Description:

2.Solutions:

/**
 * Created by sheepcore on 2019-05-10
 * 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 newhead = new ListNode(-1);
        ListNode cur;
        if(head == null || head.next == null)
            return head;
        else{
            ListNode pre = head;
            cur = pre.next;
            newhead.next = null;
            while (cur != null){
                pre.next = newhead.next;
                newhead.next = pre;
                pre = cur;
                cur = cur.next;
            }
            pre.next = newhead.next;
            newhead.next = pre;
            return newhead.next;
        }
    }
}