📄 queuelink.java
字号:
package keti2;
public class QueueLink {
public int rear;
public int front;
public int total;
public String[] sms = new String[31];
public QueueLink() {
for (int i = 1; i < 31; i++)
sms[i] = "";
rear = 1;
front = 1;
total = 0;
}
int isnull() {
if (rear == front)
return 1;
else
return 0;
}
int isfull() {
if (add(rear) == front)
return 1;
else
return 0;
}
int add(int k) {
int m;
k = (k + 1) % 31;
m = k;
return m;
}
int Enqueue(String text) {
if (isfull() == 0) {
sms[rear] = text;
rear = add(rear);
total++;
return 1;
}
else
return 0;
}
String DeQueue() {
String text = new String();
if (isnull() == 0)
text = sms[front];
front = add(front);
total--;
return text;
}
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -