#include <iostream>
#include <string>
using namespace std;
typedef struct node
{
int number;
int password;
struct node *next;
}SLink;

int GetLength(SLink *sq)
{

int i=1;
SLink *p=sq->next;
while(p!=sq)
{
i++;p=p->next;
}
return i;
}

int DelElem(SLink *sq,int i)
{
int j=1;
SLink *p=sq,*q;
if(i<1 || i>GetLength(sq))
return 0;
else if(i==1)
{
if(GetLength(sq)==1)
{q=sq;free(q);
sq=NULL;}
else
{
while(j<GetLength(sq))
{
p=p->next;j++;
}
q=sq;
p->next=q->next;
sq=q->next;
free(q);
return 1;
}
}
else
{
while(j<i-1)
{
p=p->next;j++;
}
q=p->next;
p->next=q->next;
free(q);
return 1;
}
}

void main()
{
int n;
cout << "n=";
cin >> n;
int m;
cout <<"m=";
cin >> m;

SLink *sq ;
SLink *people = (SLink *)malloc(sizeof(SLink));
people->number=1;
cout << "people->password=" ;
cin >> people->password;
people->next=people;
SLink *lq =people;

for(int i=1;i<n;i++)
{
sq =(SLink *)malloc(sizeof(SLink));
sq->number =i+1;
cout <<"sq->password=";
cin >> sq->password;
lq->next =sq;
sq->next =people;
lq = sq;
}

DelElem(people,1);
for(sq=people;sq->next!=people;sq=sq->next)
{

cout << sq->number;

//cout << sq->next;
}
cout << sq->number;

}
为什么是死循环?

这个同学,你给点解释好不好啊
这样看太麻烦,太难懂了啊
不知道你要做什么啊

q=sq;
p->next=q->next;
sq=q->next;
free(q);

没有保存q上一个接点,删除错误
一个比较好的办法以后用这样的方便
例如删一个接点
不要用这个接点本身去判断,用他的上一个接点去判断
if(pNow->next=要删除的)
{
struct tmp=pNow->next;
pNow->next=pNow->next->next;
free(tmp);
这样免去了保存删除接点上一接点的麻烦
}

while(p!=sq)//原因在这
{
i++;p=p->next;
}
我跟踪了一下
楼主的链表绕成了一圈
(估计是楼主故意的)
这句话楼主想让P找到sq