# 13825 - The Last of DYY's Hamon >author: Utin ###### tags: `linked list` --- ## Brief See the code below ## Solution 0 ```c= typedef struct _Node { int id; struct _Node* next; } Node; void reverse(Node* node_l, Node* node_r) { Node* pre_curr = node_l; Node* curr = node_l->next; Node* next_curr = curr->next; curr->next = node_r->next; while (curr != node_r) { pre_curr = curr; curr = next_curr; next_curr = next_curr->next; curr->next = pre_curr; } node_l->next = node_r; } // By Utin ``` ## Reference