Day4 Linkedlist 2 P24 P19 P160 P142

P24

SwapPairs is kind of tricky, draw the flow chart, and find all the procedures. Remember to differentiate pre=cur.next and cur.next=pre

Avoid using cur.next.next as it's problematic, it will skip pairs

Recursive is important in this problem, it's more plain and organized.

P19

I learned from the hint and did it by myself, double pointer is so important and even basic for solving problems in Linkedlist. There's just a small problem

P160

The skillful procedure is a+c+b=b+c+a, the pointers walk the same distance by pointing C3 to headB; it's an advanced application of double pointer

P142

服了

Seems like a math problem