| https://leetcode.com/problems/reverse-linked-list | Easy |
|---|
class Solution {
fun reverseList(head: ListNode?): ListNode? {
var cur = head
var prev: ListNode? = null
while (cur != null) {
val nxt = cur.next
cur.next = prev
prev = cur
cur = nxt
}
return prev
}
}