JAVA程式討論

參考一下我的方法吧!!省掉允長的程式碼

import java.util.LinkedList;
import java.util.List;

public class Token {
public static void main(String args[]) {
int[] number = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
List<Integer> list = new LinkedList<Integer>();
for (int i : number) {
list.add(i);
}
int step = 2;
int i = 0;
while (list.size() != 1) {
i = i + step;
i = (i >= list.size()) ? i % list.size() : i;
list.remove(i);
}
for (int j : list) {
System.out.println(j);
}
}
}

public class Test {
public static void main(String[] args) {
final int NumOfPeople=10;
final int Step=2;
Test t = new Test();

int[] a = new int[NumOfPeople];
int i, k, n=0;
int num=NumOfPeople;

for ( i=0; i < num; i++ ) {
a[i] = 0;
}
i = Step;
a[i] = 1;
System.out.print(( i + 1 ) + " " );
k = 1;
while ( k < num-1 ) {
i = t.find_next( a, i, num, Step );
a[i] = 1;
System.out.print(( i + 1 ) + " " );
k++;
}
System.out.println();

i = 0;
while (( i < num ) && ( a[i] == 1 )) {
i++;
}
System.out.println("The last one to stand is " + (i + 1));
}

public static int find_next( int[] a, int n, int num, int step ) {
int i=n;
int k=0;

while ( a[i] == 1 ) {
i++;
i %= num;
}
while ( k < step ) {
i++;
i %= num;
while ( a[i] == 1 ) {
i++;
i %= num;
}
k++;
}
return i;
}
}

// The Step and NumOfPeople are tunable. You can play with them a bit.
// Don't have much time to debug but I think this should work ok.

妳那個加總設為<=1時停止程式看看

不知道是我的問題還是題目的問題
我程式跑出來是顯示全部都被吃掉跟本沒有一個人是活的
大大你能不能算一下最後會不會剩一個人
如果是剩一個人我在算看看= =