You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

59 lines
1.7 KiB

2 years ago
#include <bits/stdc++.h>
using namespace std;
// https://blog.csdn.net/weixin_44412311/article/details/107432816
// https://blog.csdn.net/sdlwzzm19971226/article/details/79873900
/* <20><><EFBFBD><EFBFBD>һ<EFBFBD><D2BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> */
struct ListNode {
int num;
ListNode *next;
};
int main() {
int king, i;
//ʵ<><CAB5><EFBFBD><EFBFBD>ͷ<EFBFBD>ڵ<EFBFBD>
ListNode *head = new ListNode; //<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڴ<EFBFBD><DAB4><EFBFBD><EFBFBD><EFBFBD>
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ָ<EFBFBD>룬ָ<EBA3AC><D6B8>ͷ<EFBFBD>ڵ<EFBFBD>
ListNode *p, *q = head;
//<2F><>һ<EFBFBD><D2BB><EFBFBD><EFBFBD><EFBFBD>ӵ<EFBFBD><D3B5><EFBFBD><EFBFBD><EFBFBD>
head->num = 1;
//<2F><>ʼ<EFBFBD><CABC><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>29ֻ<39><D6BB><EFBFBD><EFBFBD>
for (i = 1; i < 30; i++) {
p = new ListNode; //<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ӵĽڵ<C4BD><DAB5><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ռ<EFBFBD>
p->num = i + 1; //<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֵ
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ӵĽڵ<C4BD><DAB5>ӵ<EFBFBD><D3B5><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>β<EFBFBD><CEB2><EFBFBD><EFBFBD>
q->next = p;
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><D2BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><D2BB><EFBFBD>ڵ<EFBFBD><DAB5>ϣ<EFBFBD><CFA3><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD>ε<EFBFBD><CEB5><EFBFBD><EFBFBD><EFBFBD>
q = p;
}
//<2F><><EFBFBD><EFBFBD>һ<EFBFBD><D2BB><EFBFBD><EFBFBD>β<EFBFBD>ͽ<EFBFBD><CDBD><EFBFBD>head
q->next = head;
//<2F><>ʼ<EFBFBD><CABC><EFBFBD><EFBFBD><EFBFBD><EFBFBD>̭
p = head;
for (i = 1; i < 30; i++) { //<2F><><EFBFBD><EFBFBD>̭29ֻ
p = p->next; //p<><70>1<EFBFBD><31>
q = p->next; //q<><71>p<EFBFBD>Ļ<EFBFBD><C4BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>1<EFBFBD><31><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڵ<EFBFBD><DAB5><EFBFBD>3<EFBFBD><33><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ˣ<EFBFBD><CBA3><EFBFBD>Ҫɾ<D2AA><C9BE><EFBFBD>ˡ<EFBFBD>
printf("<EFBFBD><EFBFBD>%d<><64><EFBFBD><EFBFBD>̭<EFBFBD><CCAD>%dֻ<64><D6BB><EFBFBD>ӣ<EFBFBD>\n", i, q->num);
p->next = q->next; //q->next:<3A><>̭<EFBFBD><CCAD><EFBFBD>ĺ<EFBFBD><C4BA>ӵ<EFBFBD><D3B5><EFBFBD>һֻ<D2BB><D6BB><EFBFBD><EFBFBD>, p->next = q->next <20><><EFBFBD><EFBFBD>̭<EFBFBD><CCAD><EFBFBD>ĺ<EFBFBD><C4BA>ӵ<EFBFBD><D3B5><EFBFBD>һֻ<D2BB><D6BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>̭<EFBFBD><CCAD><EFBFBD><EFBFBD><EFBFBD>ӵ<EFBFBD>ǰһֻ<D2BB><D6BB><EFBFBD>жԽ<D0B6>
p = q->next; //<2F><>̭<EFBFBD><CCAD><EFBFBD>ĺ<EFBFBD><C4BA>ӵ<EFBFBD><D3B5><EFBFBD>һֻ<D2BB><D6BB>Ϊ<EFBFBD>µ<EFBFBD>p
//<2F><><EFBFBD>ٽڵ<D9BD>
delete q;
q = NULL;
}
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
king = p->num;
//<2F><><EFBFBD>ٽڵ<D9BD>
// <20><><EFBFBD>õķ<C3B5><C4B7><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ұָ<D2B0><D6B8>:<3A><>׼<EFBFBD><D7BC><EFBFBD><EFBFBD>
// https://blog.csdn.net/u011301123/article/details/9293297
// https://blog.csdn.net/qwer1542112264/article/details/103524911
// https://www.cnblogs.com/uniqueliu/archive/2011/07/18/2109778.html
delete p;
p = NULL;
printf("<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ǵ<EFBFBD>%dֻ<64><D6BB>\n", king);
return 0;
}