思想:将数据存储到一个链表中,此链表首尾相连形成一个环,删除指定的数即是删除相应的节点,直到链表为空为止。
代码如下:
先写一个节点类:
class Node {
int data;
Node next = null;
public Node(int data)
{
this.data = data;
}
}
再写一个Circle类,此类有两个方法,add方法形成一个首尾相连的链表,存储数据;用delete方法来删除相应的节点,即删除相应的数
class Circle {
static Node head = null;
Node tail = null;
int n =0;
public void add(int d)
{
Node newNode = new Node(d);
if(head==null)
{
head = newNode;
return;
}
Node tmp = head;
while(tmp.next!=null&&n>1)
{
tmp =tmp.next;
}
tmp.next = newNode;
n--;
if(n==1)
{
tail = newNode;
newNode.next = head;
}
}
public void delete(int m)
{
if(m==1)
{
System.out.println(head.data);
head = head.next;
tail.next=head;
}
else
{
int i =2;
Node preNode = head;
Node curNode = preNode.next;
while(i!=m)
{
preNode = curNode;
curNode = curNode.next;
i++;
}
preNode.next = curNode.next;
head = curNode.next;
System.out.println(curNode.data);
}
}
}
最后test类完成测试
public class Test {
public static void main(String[] args) {
// TODO Auto-generated method stub
Circle circle = new Circle();
int a =10;
int b =10;
circle.n =10;
for(int i =1;i<=a;i++)
{
circle.add(i);
}
while(a>0)
{
circle.delete(b);
a--;
}
}
}
运行结果:
10
1
3
6
2
9
5
7
4
8