java堆栈功能队列_java集合框架:浅谈如何使用LInkedList实现队列(Queue)和堆栈(Stack)...

下面写两个例子

学生类:

int stuId;

public int getStuId() {

return stuId;

}

public void setStuId(int stuId) {

this.stuId = stuId;

}

public String getStuName() {

return stuName;

}

public void setStuName(String stuName) {

this.stuName = stuName;

}

public int getAge() {

return age;

}

public void setAge(int age) {

this.age = age;

}

String stuName;

int age;

public Student(){

}

public Student(int stuId,String stuName,int age){

this.age = age;

this.stuId = stuId;

this.stuName = stuName;

}

public String toString() {

return ("学生姓名:"+this.stuName+"学生年龄"+this.age+"学生编号"+this.stuId);

}

队列

自定义方法实现LInkedList

LinkedList lists =new LinkedList();

public void push(Object object){

lists.addLast(object);

}

public Object pop(){

return lists.removeFirst();

}

实现方法

System.out.println("在队列中添加对象");

MyQuene quene = new MyQuene();

quene.push(new Student(1,"学生1",20));

quene.push(new Student(2,"学生2",21));

quene.push(new Student(3,"学生3",23));

for (Object object : quene.lists) {

Student student = (Student)object;

System.out.println(student.toString());

}

System.out.println("在队列中删除对象");

quene.pop();

for (Object object : quene.lists) {

Student student = (Student)object;

System.out.println(student.toString());

}

堆栈:

自定义方法,并实现

LinkedList lists =new LinkedList();

public void push(Object object){

lists.addFirst(object);

}

public Object pop(){

return lists.removeLast();

}

System.out.println("在队列中添加对象");

MyStack Stack = new MyStack();

Stack.push(new Student(1,"学生1",20));

Stack.push(new Student(2,"学生2",21));

Stack.push(new Student(3,"学生3",23));

for (Object object : Stack.lists) {

Student student = (Student)object;

System.out.println(student.toString());

}

System.out.println("在队列中删除对象");

Stack.pop();

for (Object object : Stack.lists) {

Student student = (Student)object;

System.out.println(student.toString());

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值