鏈表 指針

typedef struct LNode 
{
	ElemType data;
	struct LNode *next;
}LNode,*LinkList;

Status ListInsert(LinkList &L, int i, ElemType &e)
{
	LinkList p, s;
	int j;
	p = L; j = 0;
	while (p && (j < i - 1))
	{
		p = p->next; 
		++j;
	}
	if (!p || j > i - 1)
		return ERROR;
	s = new LNode;
	s->data = e;
	s->next = p->next;
	p = s;
	return OK;
}
![大佬們幫我看下這個指針怎麼錯啦，該怎麼改一下 ](https://img-blog.csdnimg.cn/20181120151714913.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQzMzEzNTM1,size_16,color_FFFFFF,t_70)