***
* 双循环封闭链路
*/
public class Main6 {
public static void main(String[] args) {
NodeCircle nodeCircle = new NodeCircle(300);
int countNum = 0;
Node n = nodeCircle.first;
while(nodeCircle.count>1){
countNum ++;
if(countNum == 7){
countNum = 0;
nodeCircle.delete(n);
}
n = n.right;
}
System.out.println(nodeCircle.first.id);
}
}
class Node{
int id;
Node left;
Node right;
}
class NodeCircle{
int count = 0;
Node first, last;
NodeCircle(int n){
for(int i = 0; i < n; i ++){
add();
}
}
void add(){
Node node = new Node();
node.id = count;
if(count <= 0){
first = node;
last = node;
node.left = node;
node.right = node;
}else
双向循环封闭链表
最新推荐文章于 2024-02-07 22:15:37 发布