weixin_44455476的博客

package cn.chmcyz.linkedstack;/** * @author 谌涣谋 * @date 2020/5/17 - 0:08 */public class LinkedStackDemo { public static void main(String[] args) { LinkedStack stack=new LinkedStack(); stack.push(new Node(1)); stack.push(ne

package cn.chmcyz.arraystack;/** * @author 谌涣谋 * @date 2020/5/16 - 20:32 */public class ArrayStackDemo { public static void main(String[] args) { ArrayStack stack=new ArrayStack(5); stack.push(1); stack.push(2); st

/** * 反转链表思路 * 1.定义一个新链表 * 2.遍历链表，每次将当前结点插入新链表的头部，也就是头插法 */ public void reverse(HeroNode head){ HeroNode temp=head.getNext(); if(temp==null || temp.getNext()==null){ System.out.println(666); .

package cn.chmcyz.linkedlist;/** * @author 谌涣谋 * @date 2020/5/14 - 17:01 */public class SingleLinkedListDemo { public static void main(String[] args) { SingleLinkedList list=new SingleLinkedList(); HeroNode node1=new HeroNode(1,"

队列定义队列是一种先进先出的数据结结构。队列的使用场景银行排队挂号等。Java用数组实现package cn.chmcyz.queue;package cn.chmcyz.queue;/** * @author 谌涣谋 * @date 2020/5/12 - 17:00 */public class ArrayQueueDemo { public static void main(String[] args) { ArrayQueue queue=new.

package cn.chmcyz.sparsearray;/** * @author 谌涣谋 * @date 2020/5/11 - 19:44 */public class TestSparseArray { /** * 原始数组 * [ * [0,0,0,0,0,0,0,0,0,1], * [0,0,0,0,0,0,0,0,0,0], * [0,0,0,0,0,0,0,0,0,0], * [0,0,0,0,8,0,