Reorder List: LC medium, GFG hard

Title Link:

Force buckle, Geeksforgeeks The idea of ​​solving the problem

We need to use two pointers to point to the head and tail of the linked list.

Method

Step 1: Use the fast slow pointer method to find the midpoint of the linked list.

Step 2:

Divide the linked list into two parts: the first half and the second half .

Step 3: Use the function to reverse the second half of the linked list. firstHalf secondHalf Step 4:

In the last step, merge the second half and the first half of the reversal to get the final result.

complexity reverse()

Time complexity: o (n) Space complexity: O (1)

code

• For more solutions, please visit:
github
Personal Homepage:

Force buckle: DEVN007

Geeksforgeeks Personal Homepage: GFG: DEVNIRWAL16

The above is the detailed content of Reorder List: LC medium, GFG hard. For more information, please follow other related articles on the PHP Chinese website!