206. 反转链表
/**
* 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) {
ListNode dummyHead = null;
ListNode curr = head;
while (curr != null) {
ListNode next = curr.next;
if (dummyHead == null) {
curr.next = null;
} else {
curr.next = dummyHead;
}
dummyHead = curr;
curr = next;
}
return dummyHead;
}
}