问题:n个人围成一圈,从某个人开始算step个数,被数到的那个人被淘汰,求最后的胜利者。
typedef struct Node
{
int val;
struct Node *next;
struct Node *pre;//用于存放头节点的前一个元素,其实这里我并不是准备定义双向链表
}Node;
int Joseph(Node *head,int step,int n)
{
assert(NULL != head);
Node *nptr = head;
Node *preNode = head->pre;
while (n != 1)//直到剩下最后一个元素为止
{
Node *tmp = NULL;
for (int i = 1; i < step; i++)//step等于n时,循环n-1次,因为自己本身算一次。
{
preNode = nptr;
nptr=nptr->next;
}
preNode->next = nptr->next;
free(nptr);//删除掉的元素释放其空间。
nptr = preNode->next;
n--;//元素个数减1
}
return nptr->val;
}
测试用例:
void main()
{
Node *n1 = (Node*)malloc(sizeof(Node));
Node *n2 = (Node*)malloc(sizeof(Node));
Node *n3 = (Node*)malloc(sizeof(Node));
Node *n4 = (Node*)malloc(sizeof(Node));
Node *n5 = (Node*)malloc(sizeof(Node));
n1->val = 1;
n1->pre = n5;
n1->next = n2;
n2->val = 2;
n2->next = n3;
n3->val = 3;
n3->next = n4;
n4->val = 4;
n4->next = n5;
n5->val = 5;
n5->next = n1;
int killed = Joseph(n1, 4, 5);
}
结果输出:
验证其正确性:
结论:结果正确