带头结点的链表去重

带头结点的链表去重

说明

*typedef struct _BOTTOM_REC_T
{
char        m_chDevIp[64];
int         m_iDevPort;
struct _BOTTOM_REC_T *next;
}BOTTOM_REC_T;*

**BOTTOM_REC_T *ListDuplicateRemoval(BOTTOM_REC_T *pNode)
{
BOTTOM_REC_T *p, *q, *r;
p=pNode->next;
while(p)
{
q=p;
while(q->next)
{
if(!strcmp(q->next->m_chDevIp, p->m_chDevIp))
{
r=q->next;
q->next=r->next;
sc_free(r);
}
else
q=q->next;
}
p=p->next;
}
return pNode;
}**