数3退1，数组的环形访问

public class Count3 {public static void main(String[] args) {boolean [] array = new boolean [500];for (int i = 0; i < array.length; i++){array[i] = true;}int cursor = 0;//数组的游标int counter = 0;//数组内的计数器int remain = array.length;while (remain > 1){if (array[cursor] == true){counter++;if (counter == 3){array[cursor] = false;//计数器的增长速度比游标少1counter = 0;remain--;}}cursor++;if (cursor == array.length){cursor = 0;}}//通过上述循环，达成了数组的封闭环for (int i = 0; i < array.length; i++){if (array[i] == true)System.out.print("最终留下的是第" + (i+1) + "个数");}}}