Single-chain table inversion algorithm

Run the code first.

Void reverse (list * head) {list * P, * TMP; P = head-> next; // P points to the node currently being processed TMP = p-> next; // TMP points to the first node that has not been processed p-> next = NULL; // The first node of the original single linked list will become the last node after the inversion head-> next = P; // insert P = TMP behind the header of the single-chain table; // start processing the following nodes while (p) {TMP = p-> next; p-> next = head-> next; head-> next = P; P = TMP ;}}

The idea is to insert the accessed node into the head of the linked list while traversing the entire linked list.

In this way, after the traversal, the inverted chain table is completed.