链表实现队列,
1,创捷一个储存数据和地址的类
2,创建一个含有头部的类和一个不断传引用的中间类
package com.ui629;
public class Node {
private static Noded next;//头部类
private static Noded last;//中间类
private static int length;
public static void save(int data_1) {
if (next == null) {
Noded node =new Noded();
node.data = data_1;
next = node;
last = next;
length++;
}
else {
Noded node =new Noded();
node.data = data_1;
last.next = node;
last = last.next;
length++;
}
}
public static void change(int data_1, int index) {
int count = 0;
last = next;
while (count != index) {
last = last.next;
count++;
}
last.data = data_1;
}
public static void check() {
int count = 0;
last = next