Leetcode Algo Day4

Problem: 24. Swap Nodes in Pairs

Time: 20min

Method: simulation with 2 temp variables

Reflection: The while condition should ensure cur.next and cur.next.next both exist. Should save temp based on cur.xxx. The temp variables should save the pre node, also remember to update to the pre node inside the loop for the next swap.

Time complexity: O(N)

Space complexity: O(1)

Problem: 19. Remove Nth Node From End of List

Time: 10min

Method: two pointers

Reflection: Instead of setting pre.next = cur, should set pre.next = pre.next.next.

Time complexity: O(N)

Space complexity: O(1)

Problem: 面试题 02.07. Intersection of Two Linked Lists LCCI

Time: 10min

Method: two pointers, align length

Reflection: After looping to the end, need to be reset cur back to the head. 

Time complexity: O(N+M)

Space complexity: O(1)