import java.util.Scanner; public class Main { public static void main(String[] args) { int n; Scanner S = new Scanner(System.in); n = S.nextInt(); Createlist A = new Createlist(); A.setlen(n); A.create(); A.traverse(); } } class Child { int n; Child next=null; public Child(int n ) { this.n = n; } } class Createlist { Child head = null; Child tem = null; int n=0; public void setlen(int n) { this.n=n; } public void create() { for(int i=0;i<n;++i) { if(i==0) { Child pnew =new Child(i+1); this.head = pnew; this.tem= pnew; } else { Child pnew =new Child(i+1); tem.next= pnew; tem = pnew; } } tem.next = head; } public void traverse() { Child T = this.head; while(n != 1) { for(int j =1;j<2;++j) { T = T.next; } T.next=T.next.next; T = T.next; --n; } System.out.println(T.n); } }
解题思路:
注意事项:
参考代码:
0.0分
0 人评分
Pascal三角 (C语言代码)格式错误浏览:520 |
母牛的故事 (C语言代码)浏览:932 |
【蟠桃记】 (C语言代码)浏览:664 |
1024题解浏览:808 |
C语言程序设计教程(第三版)课后习题5.4 (C语言代码)浏览:561 |
sizeof的大作用 (C语言代码)浏览:1028 |
数组与指针的问题浏览:717 |
C语言训练-大、小写问题 (C语言代码)浏览:681 |
C语言程序设计教程(第三版)课后习题10.7 (用指针求解)浏览:1475 |
盐水的故事 (C语言代码)浏览:1528 |