假设链表的头结点为head
note *befor;
note *after;
befor = head;
after = befor->next;
while(after-> != NULL)
{
after = befor->next;
befor->data = befor->data-after->data;
befor->next = after->next;
}
大概算法就是这样样子剩下的你自己看看根据实际情况改一下应该不难
内容全部来源于网络收集，如有侵权，请联系网站删除：QQ：24596024