C++ Folyd龜兔賽跑演算解Leetcode 234, 143 Reorder List

C++ Folyd龜兔賽跑演算解Leetcode 234, 143  Reorder List

今日Leetcode的問題，應該是連續三個相關Linked List問題的總結，基本上都先考慮純單向鏈結的解法，如加上其他容器如deque, stack, vector就會簡單許多。

-----

Today's Leetcode question should be a summary of three consecutive Linked List questions. Basically, we first consider the solution of pure singly linked links. It will be much simpler if we add other containers such as deque, stack, or vector.

[codes on Leetcode]https://leetcode.com/problems/reorder-list/solutions/4912225/fast-slow-find-mid-reverse-merge-2-lists-vs-deque-vs-recursion-15ms-beats-98-75/

[Linked List play list]https://www.youtube.com/watch?v=LZ6oARGKnZA&list=PLYRlUBnWnd5JlWsYxeDicEdfa8ae-U3Jn

[Leetcode程式]https://www.youtube.com/watch?v=XpO9wcI8KAg&list=PLYRlUBnWnd5IdDHk2BjqXwesydU17z_xk