Common algorithmic questions: Inverse single-linked list

Idea: Using the head interpolation method to establish a single linked list, each insertion of a node is inserted in the head node, the first point to the head node null, and then the remaining nodes using the head interpolation method to build a table, you can realize the single-linked table inverse.

Code:
Set the target single-linked list L with the node 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;        q;     }}

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

Common algorithmic questions: Inverse single-linked list