说明
对于JAVA中一维数组的应用可以用下面的一个算法-数三退一来进行学习,即给定一个上限数,然后从零开始数,每数三下,那么第三个数则退出该数群,则最后一个剩下的数排在原来数群的哪一位?
代码
public class Count3Quit {
public static void main (String[] args) {
boolean [] arr = new boolean [500 ];
for (int i = 0 ; i<arr.length; i++) {
arr[i] = true ;
}
int leftCount = arr.length;
int countNum = 0 ;
int index = 0 ;
while (leftCount > 1 ) {
if (arr[index] == true ) {
countNum ++;
if (countNum == 3 ) {
countNum = 0 ;
arr[index] = false ;
leftCount --;
}
}
index ++;
if (index == arr.length) {
index = 0 ;
}
}
for (int i = 0 ; i < arr.length; i++) {
if (arr[i] == true ) {
System.out.println(i);
}
}
}
}
public class Count3Quit2 {
public static void main (String[] args) {
KidCircle kc = new KidCircle(500 );
int countNum = 0 ;
Kid k = kc.first;
while (kc.count > 1 ) {
countNum ++;
if (countNum == 3 ) {
countNum = 0 ;
kc.delete(k);
}
k = k.right;
}
System.out.println(kc.first.id);
}
}
class Kid {
int id;
Kid left;
Kid right;
}
class KidCircle {
int count = 0 ;
Kid first,last;
KidCircle(int n) {
for (int i = 0 ; i < n; i++) {
add();
}
}
void add() {
Kid k = new Kid();
k.id = count;
if (count <= 0 ) {
first = k;
last = k;
k.left = k;
k.right = k;
}
else {
last.right = k;
k.left = last;
k.right = first;
first.left = k;
last = k;
}
count ++;
}
void delete(Kid k) {
if (count <= 0 ) {
return ;
}
else if (count == 1 ) {
first = last = null ;
}
else {
k.left.right = k.right;
k.right.left = k.left;
if (k == first) {
first = k.right;
}
else if (k == last) {
last = k.left;
}
}
count --;
}
}
总结
对于这个算法的理解就是实现封闭性数组(环状数组)的一个首尾连接的问题,理解起来有一些困难。但是自己写一遍之后就清楚多了。