链表-D-链表实现栈
来源:互联网 发布:pythonpath linux 编辑:程序博客网 时间:2024/06/06 02:39
package e_link.D_stack;
public class Link {
public long data;
public Link next;
public Link(long d) {
data = d;
}
public void displayLink(){
System.out.println(data);
}
}package e_link.D_stack;
public class LinkList {
private Link first;
public LinkList() {
first = null;
}
public boolean isEmpty() {
return first == null;
}
public void insertFirst(long dd) {
Link link = new Link(dd);
link.next = first;
first = link;
}
public long deleteFirst() {
Link current = first;
first = first.next;
return current.data;
}
public void displaysList(){
Link current=first;
while(current!=null){
current.displayLink();
current=current.next;
}
}
}package e_link.D_stack;
public class LinkStack {
private LinkList theList;
public LinkStack() {
theList = new LinkList();
}
public void push(long j) {
theList.insertFirst(j);
}
public long pop() {
return theList.deleteFirst();
}
public boolean isEmpty(){
return theList.isEmpty();
}
public void displayStack(){
theList.displaysList();
}
}package e_link.D_stack;
/**
* 链表实现栈
*
* @author Administrator
*
*/
public class LinkStackApp {
public static void main(String[] args) {
LinkStack linkStack = new LinkStack();
linkStack.push(10);
linkStack.push(20);
linkStack.push(30);
linkStack.push(40);
linkStack.displayStack();
linkStack.pop();
linkStack.push(70);
linkStack.push(40);
System.out.println("-----");
linkStack.displayStack();
linkStack.pop();
linkStack.pop();
System.out.println("-----");
linkStack.displayStack();
}
}
public class Link {
public long data;
public Link next;
public Link(long d) {
data = d;
}
public void displayLink(){
System.out.println(data);
}
}package e_link.D_stack;
public class LinkList {
private Link first;
public LinkList() {
first = null;
}
public boolean isEmpty() {
return first == null;
}
public void insertFirst(long dd) {
Link link = new Link(dd);
link.next = first;
first = link;
}
public long deleteFirst() {
Link current = first;
first = first.next;
return current.data;
}
public void displaysList(){
Link current=first;
while(current!=null){
current.displayLink();
current=current.next;
}
}
}package e_link.D_stack;
public class LinkStack {
private LinkList theList;
public LinkStack() {
theList = new LinkList();
}
public void push(long j) {
theList.insertFirst(j);
}
public long pop() {
return theList.deleteFirst();
}
public boolean isEmpty(){
return theList.isEmpty();
}
public void displayStack(){
theList.displaysList();
}
}package e_link.D_stack;
/**
* 链表实现栈
*
* @author Administrator
*
*/
public class LinkStackApp {
public static void main(String[] args) {
LinkStack linkStack = new LinkStack();
linkStack.push(10);
linkStack.push(20);
linkStack.push(30);
linkStack.push(40);
linkStack.displayStack();
linkStack.pop();
linkStack.push(70);
linkStack.push(40);
System.out.println("-----");
linkStack.displayStack();
linkStack.pop();
linkStack.pop();
System.out.println("-----");
linkStack.displayStack();
}
}
0 0
- 链表-D-链表实现栈
- OpenGL实现3d
- Direct3D实现2D
- OpenGL实现3d
- D指针/私有实现
- D堆的实现
- 3D翻转实现
- 8d 通过计时器实现一个表钟
- .net实现3D饼图
- XP实现3D效果
- .net实现3D饼图
- .net实现3D饼图
- .net实现3D饼图
- .net实现3D饼图
- .net实现3D饼图
- .net实现3D饼图
- .net实现3D饼图
- .net实现3D饼图
- redis应用
- 1115. Counting Nodes in a BST (30)
- 链表-C-双端链表
- 关于编程、重构等 42条建议 下
- mysql主从复制
- 链表-D-链表实现栈
- Backbone.js中的Events模块如何使用?
- 链表-E-实现队列
- 计算机操作系统知识图谱
- 数论(多个数gcd) CodeForces757B Bash's Big Day
- CentOS 7下MySQL 5.7安装、配置与应用
- 226. Invert Binary Tree
- 链表-F-有序链表
- 链表-G- 利用有序链表给数组排序