摘要:
java用栈实现计算器完整版 栈类 class Stack { private int maxSize; private int[] stack; private int top = -1; public Stack(int maxSize) { this.maxSize = maxSize; st 阅读全文
摘要:
joseph问题 单向环形链表 节点类 class Node { public int id; public Node next; @Override public String toString() { return "Node{" + "id=" + id + '}'; } public Nod 阅读全文
摘要:
java双向链表的实现 双向链表的增删改查 class DoubleLinkedList { private Node head = new Node(0, "head"); public void deleteNode(Node node) { if (isEmpty()) { System.ou 阅读全文