public class Test {
private class Node{
Node next = null;
int data;
public Node(int t) {
this.data = t;
}
}
private Node head;
private int len;
public Test() {
this.head = new Node(0);
this.len = 0;
this.head.next = head;
}
//获取第Index个节点
public Node getNode(int index) {
if(index<0 || index>len) {
th
Java用循环链表实现魔术师发牌问题和拉丁方阵
最新推荐文章于 2021-03-13 07:33:42 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)