关于linked list的java程序设计

Posted 2023-02-28

There is a data structure called a drop-out stack that behaves like a stack in every respect except that if the stack size is n, when the n+1 element is pushed, the first element is lost. Implement a drop-out stack using links.
如题要求，用linked list

按要求正确运行即可得分

package linklist;

import java.util.LinkedList;
import java.util.Scanner;

public class DropOutStack

private LinkedList<Object> stackList = new LinkedList<Object>();

private int stackSize;

/**
*
* push
* 往结构当中添加元素
* @param object
*/
public void push(Object object)
// 当链表的长度超过指定大小时溢出顶部元素
while(stackList.size() >= stackSize)
stackList.removeFirst();
stackList.add(object);


/**
* 打印结构中的数据内容
* print
*/
public void print()
System.out.println("all data in linked list is : ");
System.out.println(stackList);


public static void main(String[] args)
Scanner s = new Scanner(System.in);
DropOutStack instance = new DropOutStack();
// 初始化结构的数组长度
System.out.println("please input the stack size : ");
instance.stackSize = s.nextInt();
while(true)
// 开始读入数据
System.out.println("please input the next element : ");
int nextObject = s.nextInt();
instance.push(nextObject);
instance.print();




搞定来分吧。太简单了 参考技术A 你是故意用英文写的？

意思是不是用链表实现入栈出栈啊？