Common algorithm questions: reverse single-chain table, and single-chain algorithm questions

Common algorithm questions: reverse single-chain table, and single-chain algorithm questions

Idea: Use the header insertion method to create a single-chain table. After each inserted node is inserted in the header node, first point the header node to NULL, and then use the header insertion method to create the table, you can reverse the configuration of a single-chain table.

Code:
Set the destination single-chain table L, and the node is of the int type.

Void Reverse (LinkList & L) {int * p = L. head-> next, * q; L. head-> next = NULL; while (p! = NULL) {q = p-> next; p-> next = L. head-> next; L. head-> next = p; p = q ;}}

The time complexity of this algorithm is O (n), and the space complexity is O (1 ).