定长队列,新元素顶掉最老元素


import lombok.Data;

import java.util.ArrayList;
import java.util.List;

public class FixedQueue<E> {

    private Node<E> head = null;

    private Node<E> tail = null;

    private int capacity;

    private int size;

    public FixedQueue(int capacity) {
        this.capacity = capacity;
    }

    public int size() {
        return this.size;
    }

    public boolean isEmpty() {
        return this.size == 0;
    }

    public void push(E element) {
        if (size == capacity) {
            remove();
        }
        Node<E> newNode = new Node<>(element, head);
        if (this.size() == 0) {
            this.tail = newNode;
        }
        this.head = newNode;
        this.size++;
    }

    public E remove() {
        if (isEmpty()) {
            throw new RuntimeException("Empty queue.");
        }
        Node<E> root = this.head;
        E element = this.tail.getElement();
        while (root != null) {
            if (root.getNext() == this.tail) {
                this.tail = root;
                this.tail.next = null;
                break;
            }
            root = root.getNext();
        }
        this.size--;
        return element;
    }


    public List<E> getAllElements() {
        Node<E> root;
        root = this.head;
        List<E> elementList = new ArrayList<>(this.size);

        for (int i = 0; i < this.size; i++) {
            elementList.add(root.getElement());
            root = root.getNext();
        }
        return elementList;
    }

    @Data
    public static class Node<E> {
        E element;
        Node<E> next;

        Node(E element, Node<E> next) {
            this.element = element;
            this.next = next;
        }
    }
}

测试类

package com.example.queue;

public class FixedQueueTest {
    public static void main(String[] args) {
        FixedQueue<String> fixedQueue = new FixedQueue<>(3);

        System.out.println("Size: " + fixedQueue.size());

        fixedQueue.push("1");
        fixedQueue.push("2");
        fixedQueue.push("3");
        fixedQueue.push("4");
        fixedQueue.push("5");

        System.out.println("Size: " + fixedQueue.size());
        System.out.println("Elements: " + fixedQueue.getAllElements());

        int size = fixedQueue.size();
        for (int i = 0; i < size; i++) {
            System.out.println(fixedQueue.remove());
        }
        System.out.println("Size: " + fixedQueue.size());
    }
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值