栈
后进先出 先进后出
package day_3;
public class Mystack {
/**
* 模拟栈的构造
* */
//底层实现是一个数组
private long[] arr;
private int top;
/**
* 默认的构造方法
* */
public Mystack() {
arr = new long[10];
top = -1;
}
/**
* 带参数的构造方法,参数为数组初始化大小
* */
public Mystack(int maxsize) {
arr = new long[maxsize];
top = -1;
}
/**
* 添加数据
* */
public void push(int value) {
arr[++top] = value;
}
/**
* 移除数据
* */
public long pop() {
return arr[top--];
}
/**
* 查看(栈顶)数据
* */
public long peek() {
return arr[top];
}
/**
* 判断是否为空
* */
public boolean isEmpty() {
return top == -1;
}
/**
* 判断是否满了
* */
public boolean isFull() {
return top == arr.length-1;
}
}
测试:
package day_3;
public class TestMyStack {
public static void main(String[] args) {
// TODO Auto-generated method stub
/**
* 先进后出 后进先出
* */
Mystack ms = new Mystack(4);//运用第二个构造
ms.push(23);
ms.push(12);
ms.push(1);
ms.push(90);
System.out.println(ms.isEmpty());
System.out.println(ms.isFull());
System.out.println(ms.peek());
System.out.println(ms.peek());
//栈的显示
while(!ms.isEmpty()) {
System.out.print(ms.pop()+",");
}
}
}
队列
先进先出 后进后出
public class MyQueue {
/**
* 模拟队列
* */
//底层使用数组
private long[] arr;
//有效数据大小
private int elements;
//队头
private int front;
//队尾
private int end;
/**
* 默认的构造方法
* */
public MyQueue() {
arr = new long[10];
elements = 0;
front = 0;
end = -1;
}
/**
* 带参数的构造方法,参数为数组的大小
* */
public MyQueue(int maxsize) {
arr = new long[maxsize];
elements = 0;
front = 0;
end = -1;
}
/**
* 添加数据:从队尾插入
* */
public void insert(long value) {
if(end == arr.length - 1) {
//重新设置
end = -1;
}
arr[++end] = value;
elements++;
}
/**
* 删除数据:从对头删除
* */
public long remove() {
long value = arr[front++];
if(front == arr.length) {
//相当于重置
front = 0;
}
elements--;
return value;
}
/**
* 查看数据,从队头查看
* */
public long peek() {
return arr[front];
}
/**
* 判断是否为空
* */
public boolean isEmpty() {
return elements == 0;
}
/**
* 判断是否为满了
* */
public boolean isFull() {
return elements == arr.length;
}
}
测试:
package day_3;
public class TestMyQueue {
public static void main(String[] args) {
// TODO Auto-generated method stub
/***
* 先进先出 后进后出
* */
MyQueue mq = new MyQueue(4);
mq.insert(23);
mq.insert(45);
mq.insert(13);
mq.insert(1);
System.out.println(mq.isFull());
System.out.println(mq.isEmpty());
System.out.println(mq.peek());
System.out.println(mq.peek());
while(!mq.isEmpty()) {
System.out.print(mq.remove()+",");
}
System.out.println("-----");
//此时重新插入就没有任何问题 溢出之后就会重置 循环列队的学习
mq.insert(23);
mq.insert(45);
mq.insert(13);
mq.insert(1);
while(!mq.isEmpty()) {
System.out.print(mq.remove()+",");
}
}
}