随笔分类 - 数据结构和算法
摘要：见csdn博主v_JULY_v的详解如下： https://blog.csdn.net/v_JULY_v/article/details/7041827?ops_request_misc=%257B%2522request%255Fid%2522%253A%252216674673931680018
阅读全文
摘要：#定义人类结构体 public class people { int num; people next; public people(int num) { this.num = num; } public int getNum() { return num; } public void setNum
阅读全文
摘要：#双向链表 package com.doubleLikedlist; import com.doubleLikedlist.hero; public class doubleLikedlist { private hero headnode=new hero(001,""); public void
阅读全文
摘要：#结构体 package com.singleLikedlist; class hero { public int num; public String name; public hero next; public hero(int num, String name) { this.num = nu
阅读全文
摘要：#主函数测试 public class criclqueue { int front; int rear; int maxsize; int[] arr; public criclqueue(int maxsize) { this.maxsize = maxsize; front = 0; rear
阅读全文
