Java8如何实现支持任意参数数量的链式栈?

2026-05-15 23:361阅读0评论SEO资源
  • 内容介绍
  • 文章标签
  • 相关推荐

本文共计540个文字,预计阅读时间需要3分钟。

Java8如何实现支持任意参数数量的链式栈?

以下是对原文的简化

text示例:Java8实现了一个支持任意参数的链栈,包括以下功能:+1 push(参数):入栈;+1 pop():出栈;+1 getSize():获取栈大小;+1 display():显示栈内容。

本文实例为大家分享了Java8实现任意参数的链栈,供大家参考,具体内容如下

1、实现功能

Java8如何实现支持任意参数数量的链式栈?

1)push():入栈;
2)pop():出栈;
3)getSize():获取栈大小;
4)display():展示栈。

以一下测试进行特别说明:

/** * The main function. */ public static void main(String[] args) { MyLinkedStack <Character> test = new MyLinkedStack<>(); test.push('2'); test.push('+'); test.push('-'); test.pop(); test.push('('); test.display(); }

输出如下,即输出顺序为栈顶、栈顶下一个…

The linked stack is:
[(, +, 2]

2、代码

package DataStructure; /** * @author: Inki * @email: inki.yinji@qq.com * @create: 2020 1026 * @last_modify: 2020 1026 */ public class MyLinkedStack <AnyType> { /** * Only used to store the head node. */ private SingleNode<AnyType> head = new SingleNode(new Object()); /** * The single linked list current size. */ private int size = 0; /** * Push element to the end of the list. * @param: * paraVal: The given value. */ public void push(AnyType paraVal) { SingleNode <AnyType> tempNode = new SingleNode<>(paraVal); tempNode.next = head.next; head.next = tempNode; size++; }//Of push /** * Pop the last element. * @return: * The popped value. */ public AnyType pop(){ if (size == 0) { throw new RuntimeException("The stack is empty."); } AnyType retVal = head.next.val; head.next = head.next.next; size--; return retVal; }//Of pop /** * Get the current size of the single linked list. * @return: * The current size of the single linked list. */ public int getSize() { return size; }//Of getSize /** * Display the single linked list. */ public void display() { if (size == 0) { throw new RuntimeException("The stack is empty."); }//Of if System.out.print("The linked stack is:\n["); SingleNode <AnyType> tempNode = head; int i = 0; while (i++ < size - 1) { tempNode = tempNode.next; System.out.printf("%s, ", tempNode.val); }//Of while System.out.printf("%s]\n", tempNode.next.val); }//Of display /** * The main function. */ public static void main(String[] args) { MyLinkedStack <Character> test = new MyLinkedStack<>(); test.push('2'); test.push('+'); test.push('-'); test.pop(); test.push('('); test.display(); } }//Of class MyLinkedStack class SingleNode <AnyType>{ /** * The value. */ AnyType val; /** * The next node. */ SingleNode<AnyType> next; /** * The first constructor. * @param * paraVal: The given value. */ SingleNode (AnyType paraVal) { val = paraVal; }//The first constructor }//Of class SingleNode

以上就是本文的全部内容,希望对大家的学习有所帮助,也希望大家多多支持易盾网络。

本文共计540个文字,预计阅读时间需要3分钟。

Java8如何实现支持任意参数数量的链式栈?

以下是对原文的简化

text示例:Java8实现了一个支持任意参数的链栈,包括以下功能:+1 push(参数):入栈;+1 pop():出栈;+1 getSize():获取栈大小;+1 display():显示栈内容。

本文实例为大家分享了Java8实现任意参数的链栈,供大家参考,具体内容如下

1、实现功能

Java8如何实现支持任意参数数量的链式栈?

1)push():入栈;
2)pop():出栈;
3)getSize():获取栈大小;
4)display():展示栈。

以一下测试进行特别说明:

/** * The main function. */ public static void main(String[] args) { MyLinkedStack <Character> test = new MyLinkedStack<>(); test.push('2'); test.push('+'); test.push('-'); test.pop(); test.push('('); test.display(); }

输出如下,即输出顺序为栈顶、栈顶下一个…

The linked stack is:
[(, +, 2]

2、代码

package DataStructure; /** * @author: Inki * @email: inki.yinji@qq.com * @create: 2020 1026 * @last_modify: 2020 1026 */ public class MyLinkedStack <AnyType> { /** * Only used to store the head node. */ private SingleNode<AnyType> head = new SingleNode(new Object()); /** * The single linked list current size. */ private int size = 0; /** * Push element to the end of the list. * @param: * paraVal: The given value. */ public void push(AnyType paraVal) { SingleNode <AnyType> tempNode = new SingleNode<>(paraVal); tempNode.next = head.next; head.next = tempNode; size++; }//Of push /** * Pop the last element. * @return: * The popped value. */ public AnyType pop(){ if (size == 0) { throw new RuntimeException("The stack is empty."); } AnyType retVal = head.next.val; head.next = head.next.next; size--; return retVal; }//Of pop /** * Get the current size of the single linked list. * @return: * The current size of the single linked list. */ public int getSize() { return size; }//Of getSize /** * Display the single linked list. */ public void display() { if (size == 0) { throw new RuntimeException("The stack is empty."); }//Of if System.out.print("The linked stack is:\n["); SingleNode <AnyType> tempNode = head; int i = 0; while (i++ < size - 1) { tempNode = tempNode.next; System.out.printf("%s, ", tempNode.val); }//Of while System.out.printf("%s]\n", tempNode.next.val); }//Of display /** * The main function. */ public static void main(String[] args) { MyLinkedStack <Character> test = new MyLinkedStack<>(); test.push('2'); test.push('+'); test.push('-'); test.pop(); test.push('('); test.display(); } }//Of class MyLinkedStack class SingleNode <AnyType>{ /** * The value. */ AnyType val; /** * The next node. */ SingleNode<AnyType> next; /** * The first constructor. * @param * paraVal: The given value. */ SingleNode (AnyType paraVal) { val = paraVal; }//The first constructor }//Of class SingleNode

以上就是本文的全部内容,希望对大家的学习有所帮助,也希望大家多多支持易盾网络。