Java数据结构与算法分析

「爱情、让人受尽委屈。」 2023-10-04 07:10 0阅读 0赞

### 持续更新中。。。 ###

#### Java数据结构与算法目录 ####

*   *  持续更新中。。。
     *  1、集合
     *  2、队列
     *   *  2.1、队列
         *  2.2、环形队列
     *  3、链表
     *   *  3.1 ==单链表==
         *  3.2 双链表
         *  3.3 环形链表
     *  4、栈
     *   *  4.1、栈
         *  4.2、栈实现综合计算器
         *  4.3、==前缀、中缀、后缀表达式，逆波兰计算器==
     *  5、递归
     *   *  5.1、==迷宫回溯==
         *  5.2、==八皇后==
     *  6、排序算法
     *   *  6.1、==冒泡排序==
         *  6.2、选择排序
         *  6.3、插入排序
         *  6.4、希尔排序
         *  6.5、==快速排序==
         *  6.6、归并排序
         *  6.7、基数排序
         *  6.8、堆排序
     *  7、查找算法
     *   *  7.1、线性查找
         *  7.2、二分查找
         *  7.3、插值查找
         *  7.4、斐波那契查找
     *  8、哈希表
     *  9、树
     *   *  9.1、二叉树
         *  9.2、顺序存储二叉树
         *  9.3、线索化二叉树
         *  9.4、堆排序
         *  9.5、赫夫曼树
         *  9.6、赫夫曼编码（数据压缩、数据解压）

### 1、集合 ###

> JAVA集合框架: [https://blog.csdn.net/weixin\_46822367/article/details/114855817][https_blog.csdn.net_weixin_46822367_article_details_114855817].

### 2、队列 ###

#### 2.1、队列 ####

> 队列: [https://blog.csdn.net/weixin\_46822367/article/details/115481155][https_blog.csdn.net_weixin_46822367_article_details_115481155].

#### 2.2、环形队列 ####

> 环形队列: [https://blog.csdn.net/weixin\_46822367/article/details/115481155][https_blog.csdn.net_weixin_46822367_article_details_115481155].

### 3、链表 ###

#### 3.1 单链表 ####

> 单向链表: [https://blog.csdn.net/weixin\_46822367/article/details/115481384][https_blog.csdn.net_weixin_46822367_article_details_115481384].

#### 3.2 双链表 ####

> 双向链表: [https://blog.csdn.net/weixin\_46822367/article/details/115481384][https_blog.csdn.net_weixin_46822367_article_details_115481384].

#### 3.3 环形链表 ####

> 环形链表和约瑟夫问题: [https://blog.csdn.net/weixin\_46822367/article/details/115481384][https_blog.csdn.net_weixin_46822367_article_details_115481384].

### 4、栈 ###

#### 4.1、栈 ####

> 栈: [https://blog.csdn.net/weixin\_46822367/article/details/115504698?spm=1001.2014.3001.5501][https_blog.csdn.net_weixin_46822367_article_details_115504698_spm_1001.2014.3001.5501].

#### 4.2、栈实现综合计算器 ####

> 栈实现综合计算器: [https://blog.csdn.net/weixin\_46822367/article/details/115504698?spm=1001.2014.3001.5501][https_blog.csdn.net_weixin_46822367_article_details_115504698_spm_1001.2014.3001.5501].

#### 4.3、前缀、中缀、后缀表达式，逆波兰计算器 ####

> 前缀、中缀、后缀表达式，逆波兰计算器: [https://blog.csdn.net/weixin\_46822367/article/details/115504698?spm=1001.2014.3001.5501][https_blog.csdn.net_weixin_46822367_article_details_115504698_spm_1001.2014.3001.5501].

### 5、递归 ###

#### 5.1、迷宫回溯 ####

> 迷宫回溯: [https://blog.csdn.net/weixin\_46822367/article/details/115481754][https_blog.csdn.net_weixin_46822367_article_details_115481754].

#### 5.2、八皇后 ####

> 八皇后: [https://blog.csdn.net/weixin\_46822367/article/details/115481754][https_blog.csdn.net_weixin_46822367_article_details_115481754].

### 6、排序算法 ###

#### 6.1、冒泡排序 ####

> 冒泡排序: [https://blog.csdn.net/weixin\_46822367/article/details/115481838][https_blog.csdn.net_weixin_46822367_article_details_115481838].

#### 6.2、选择排序 ####

> 选择排序: [https://blog.csdn.net/weixin\_46822367/article/details/115481838][https_blog.csdn.net_weixin_46822367_article_details_115481838].

#### 6.3、插入排序 ####

> 插入排序: [https://blog.csdn.net/weixin\_46822367/article/details/115481838][https_blog.csdn.net_weixin_46822367_article_details_115481838].

#### 6.4、希尔排序 ####

> 希尔排序: [https://blog.csdn.net/weixin\_46822367/article/details/115481838][https_blog.csdn.net_weixin_46822367_article_details_115481838].

#### 6.5、快速排序 ####

> 快速排序: [https://blog.csdn.net/weixin\_46822367/article/details/115481838][https_blog.csdn.net_weixin_46822367_article_details_115481838].

#### 6.6、归并排序 ####

> 归并排序: [https://blog.csdn.net/weixin\_46822367/article/details/115481838][https_blog.csdn.net_weixin_46822367_article_details_115481838].

#### 6.7、基数排序 ####

> 基数排序: [https://blog.csdn.net/weixin\_46822367/article/details/115481838][https_blog.csdn.net_weixin_46822367_article_details_115481838].

#### 6.8、堆排序 ####

> 堆排序: [https://blog.csdn.net/weixin\_46822367/article/details/115481838][https_blog.csdn.net_weixin_46822367_article_details_115481838].

### 7、查找算法 ###

#### 7.1、线性查找 ####

> 线性查找: [https://blog.csdn.net/weixin\_46822367/article/details/115482028][https_blog.csdn.net_weixin_46822367_article_details_115482028].

#### 7.2、二分查找 ####

> 二分查找: [https://blog.csdn.net/weixin\_46822367/article/details/115482028][https_blog.csdn.net_weixin_46822367_article_details_115482028].

#### 7.3、插值查找 ####

> 插值查找: [https://blog.csdn.net/weixin\_46822367/article/details/115482028][https_blog.csdn.net_weixin_46822367_article_details_115482028].

#### 7.4、斐波那契查找 ####

> 斐波那契查找: [https://blog.csdn.net/weixin\_46822367/article/details/115482028][https_blog.csdn.net_weixin_46822367_article_details_115482028].

### 8、哈希表 ###

> 哈希表: [https://blog.csdn.net/weixin\_46822367/article/details/115487154?spm=1001.2014.3001.5501][https_blog.csdn.net_weixin_46822367_article_details_115487154_spm_1001.2014.3001.5501].

### 9、树 ###

#### 9.1、二叉树 ####

> 二叉树: [https://blog.csdn.net/weixin\_46822367/article/details/115482178?spm=1001.2014.3001.5501][https_blog.csdn.net_weixin_46822367_article_details_115482178_spm_1001.2014.3001.5501].

#### 9.2、顺序存储二叉树 ####

> 顺序存储二叉树: [https://blog.csdn.net/weixin\_46822367/article/details/115482178?spm=1001.2014.3001.5501][https_blog.csdn.net_weixin_46822367_article_details_115482178_spm_1001.2014.3001.5501].

#### 9.3、线索化二叉树 ####

> 线索化二叉树: [https://blog.csdn.net/weixin\_46822367/article/details/115482178?spm=1001.2014.3001.5501][https_blog.csdn.net_weixin_46822367_article_details_115482178_spm_1001.2014.3001.5501].

#### 9.4、堆排序 ####

> 堆排序: [https://blog.csdn.net/weixin\_46822367/article/details/115482178?spm=1001.2014.3001.5501][https_blog.csdn.net_weixin_46822367_article_details_115482178_spm_1001.2014.3001.5501].

#### 9.5、赫夫曼树 ####

> 赫夫曼树: [https://blog.csdn.net/weixin\_46822367/article/details/115482178?spm=1001.2014.3001.5501][https_blog.csdn.net_weixin_46822367_article_details_115482178_spm_1001.2014.3001.5501].

#### 9.6、赫夫曼编码（数据压缩、数据解压） ####

> 赫夫曼编码（数据压缩、数据解压）: [https://blog.csdn.net/weixin\_46822367/article/details/115482178?spm=1001.2014.3001.5501][https_blog.csdn.net_weixin_46822367_article_details_115482178_spm_1001.2014.3001.5501].

[https_blog.csdn.net_weixin_46822367_article_details_114855817]: https://blog.csdn.net/weixin_46822367/article/details/114855817
[https_blog.csdn.net_weixin_46822367_article_details_115481155]: https://blog.csdn.net/weixin_46822367/article/details/115481155
[https_blog.csdn.net_weixin_46822367_article_details_115481384]: https://blog.csdn.net/weixin_46822367/article/details/115481384
[https_blog.csdn.net_weixin_46822367_article_details_115504698_spm_1001.2014.3001.5501]: https://blog.csdn.net/weixin_46822367/article/details/115504698?spm=1001.2014.3001.5501
[https_blog.csdn.net_weixin_46822367_article_details_115481754]: https://blog.csdn.net/weixin_46822367/article/details/115481754
[https_blog.csdn.net_weixin_46822367_article_details_115481838]: https://blog.csdn.net/weixin_46822367/article/details/115481838
[https_blog.csdn.net_weixin_46822367_article_details_115482028]: https://blog.csdn.net/weixin_46822367/article/details/115482028
[https_blog.csdn.net_weixin_46822367_article_details_115487154_spm_1001.2014.3001.5501]: https://blog.csdn.net/weixin_46822367/article/details/115487154?spm=1001.2014.3001.5501
[https_blog.csdn.net_weixin_46822367_article_details_115482178_spm_1001.2014.3001.5501]: https://blog.csdn.net/weixin_46822367/article/details/115482178?spm=1001.2014.3001.5501