JAVA开发工程师数据结构面试题

---

一、栈

定义栈的数据结构

public class Stack<E> {
    private Object[] data = null;
    private int maxSize = 0;
    private int top = -1;
    //构造函数：根据指定的size初始化栈
    Stack(){
        this(10); //默认栈的大小为10
    }
    Stack(int initialSize){
        if (initialSize >= 0){
            this.maxSize = initialSize;
            data = new Object[initialSize];
            top = -1;
        }else{
            throw new RuntimeException("初始化大小不能小于0："+initialSize);
        }
    }
}

数据入栈

 //进栈，第一个元素top = 0
    public boolean push(E e){
        if (top == maxSize - 1){
            throw new RuntimeException("栈已满，无法将元素入栈！");
        }else{
            data[++top] = e;
            return true;
        }
    }

数据出栈

//弹出栈顶的元素
    public E pop(){
        if (top == -1){
            throw new RuntimeException("栈为空！");
        }else {
            return (E)data[top--];
        }
    }

数据查询

public E peek(){
        if (top == -1){
            throw new RuntimeException("栈为空！");
        }else {
            return (E)data[top];
        }
    }

二、队列

定义队列的数据结构

public class Queue<E> {
    private Object[] data = null;
    private int maxSize; //队列的容量
    private  int front; //队列头，允许删除
    private int rear;   //队列尾，允许插入
    //构造函数，默认队列的大小为10
    public Queue(){
        this(10);
    }
    public Queue(int initialSize){
        if (initialSize >= 0){
            this.maxSize = initialSize;
            data = new Object[initialSize];
            front = rear = 0;
        }else {
            throw new RuntimeException("初始化大小不能小于0: " + initialSize);
        }
    }
}

向队列插入数据

//在队列的尾部插入数据
public  boolean add(E e){
    if (rear == maxSize){
        throw new RuntimeException("队列已满，无法插入新的元素!");
    }else{
        data[rear++] = e;
        return true;
    }
}

取走队列中的数据

//删除队列头部的元素：出队
public E poll(){
    if(empty()){
        throw new RuntimeException("空队列异常！");
    }else{
        E value = (E) data[front];  //临时保存队列front端的元素的值
        data[front++] = null;   //释放队列front端的元素
        return value;
    }
}

队列数据查询

//取出队列头部的元素，但不删除
public E peek(){
    if(empty()){
        throw new RuntimeException("空队列异常！");
    }else{
        return (E) data[front];
    }
}

三、链表