typedef int DataType_t;
void LList *LList_InsertNode(DataType_t data, int p, LList_t *Head)
{
LList_t *new = LList_NewNode(data);
if (new == NULL)
{
perror("Calloc memory for Head is Failed");
exit(-1);
}
if (p == 0)
{
new->next = Head->next;
Head->next = new;
return;
}
LList_t *current = Head.;
int currentp = 0;
while (current != NULL && currentp < p - 1)
{
current = current->next;
currentp++;
}
if (current == NULL)
{
printf("Position is out of range\n");
return;
}
new->next = current->next;
current->next = new;
}
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步