#include<stdio.h>
#include<stdlib.h>
struct ListNode {
int val;
struct ListNode* next;
};
int main() {
int n;
scanf_s("%d", &n);
struct ListNode* head = NULL, * head2 = head;
for(int i = 0 ;i < n; i++){
struct ListNode* t = (struct ListNode*)malloc(sizeof(struct ListNode));
t->val = i + 1;
t->next = NULL;
if (!head) {
head = t;
head2 = head;
}
else {
head->next = t;
head = head->next;
}
}
head->next = head2;
while (head2->next != head2) {
struct ListNode* t = head2->next;
head2 = head2->next->next;
t->next = head2->next;
free(head2);
head2 = t->next;
}
if (head != NULL) {
printf("%d", head2->val);
}
else {
printf("出错了!");
}
return 0;
}
0.0分
0 人评分
C语言程序设计教程(第三版)课后习题1.5 (C语言代码)浏览:640 |
C语言程序设计教程(第三版)课后习题5.7 (C语言代码)浏览:1033 |
C语言程序设计教程(第三版)课后习题8.4 (C语言代码)浏览:545 |
C语言训练-计算一个整数N的阶乘 (C语言代码)浏览:936 |
C语言程序设计教程(第三版)课后习题10.7 (C语言代码)浏览:968 |
WU-蓝桥杯算法提高VIP-勾股数 (C++代码)浏览:1606 |
众数问题 (C语言代码)浏览:830 |
WU-陶陶摘苹果2 (C++代码)浏览:973 |
C语言程序设计教程(第三版)课后习题6.3 (C语言代码)浏览:660 |
矩阵加法 (C语言代码)浏览:1722 |