/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
public class Solution {
public ListNode ReverseList(ListNode head) {
if (head == null) {
return null;
}
if(head.next == null){
return head;
}
ListNode node = new ListNode(0);
int n = 1;
while (head != null) {
ListNode node1 = new ListNode(head.val);
if (n <= 1) {
node.next = node1;
n++;
} else {
node1.next = node.next;
node.next = node1;
}
head = head.next;
}
head = node.next;
return head;
}
}