数据结构学习笔记（3）---循环链表（约瑟夫环问题）

void CreateCircleList(pCircleNode pHead)
{
int date;
cout << "请输入节点得值：";
cin >> date;
pCircleNode pTail = pHead;
while (-1 != date)
{
pCircleNode pNew = new CircleNode;
pNew->next = NULL;
pNew->date = date;
pTail->next = pNew;
pTail = pNew;
cout << "请输入节点得值：";
cin >> date;
}
pTail->next = pHead->next;
}

void ShowList(pCircleNode pHead)
{
pCircleNode p = pHead->next;
do
{
cout << p->date<<"  ";
p = p->next;
} while (p != pHead->next);
cout << endl;
}

pCircleNode Joseph(pCircleNode pHead, int n)
{
pCircleNode p = pHead;
pCircleNode pPre = NULL;;
while (p->next != pHead)
{
p = p->next;
}//找到第一个节点的前置节点
pPre = p;
p = pHead;
pHead = NULL;
while (p->next != p)//判断是否还剩最后一个节点
{
int nPos = 1;
while (nPos != n)//到达指定位置
{
pPre = p;
p = p->next;
nPos++;
}
pCircleNode pDelete = pPre->next;
pPre ->next = pPre->next->next;
delete pDelete;
p = pPre->next;//别忘记对p赋值
}
return p;
}