public LinkedLists.ListNode reverseList(LinkedLists.ListNode head) {
LinkedLists.ListNode prev = head;
LinkedLists.ListNode current = null;
LinkedLists.ListNode next = null;
if (head == null) return null;
if (head.next == null) return head;
current = prev.next;
next = current.next;
while (current != null) {
current.next = prev;
if (prev == head) {
prev.next = null;
}
prev = current;
current = next;
if (next != null) next = next.next;
}
head = prev;
return head;
}
ReverseLinkedList() {
LinkedLists.ListNode temp = new LinkedLists.ListNode(1);
LinkedLists.ListNode temp2 = new LinkedLists.ListNode(2);
temp.next = temp2;
temp2.next = null;
head = temp;
temp2.next = new LinkedLists.ListNode(3);
}
