//反转链表
Node* reverse_list(Node* head) {
if(head ==NULL || head->next == NULL) {
returnhead;
}
Node* p1 =head;
Node* p2 =head->next;
Node* p =NULL;
head->next = NULL;
while(p2) {
p =p2->next;
p2->next = p1;
p1 = p2;
p2 = p;
}
return p1;
}
//在链表指定位置插入节点
Node* insert_list(Node* head, int n, Node* newNode) {
if(n == 0) {
newNode->next = head;
head =newNode;
returnhead;
}