題目大意:給你一個單向鏈結串列的頭節點 head，把整個串列反轉並回傳新的頭節點。
範例：1 -> 2 -> 3 -> null 反轉後變成 3 -> 2 -> 1 -> null
class Solution {
public ListNode reverseList(ListNode head) {
ListNode prev = null;
ListNode curr = head;
while (curr != null) {
ListNode nextTemp = curr.next;
curr.next = prev;
prev = curr;
curr = nextTemp;
}
return prev;
}
}
iThome鐵人賽
看影片追技術