# Rust-Programming-in-Action

**Repository Path**: thinkwall/Rust-Programming-in-Action

## Basic Information

- **Project Name**: Rust-Programming-in-Action
- **Description**: No description available
- **Primary Language**: Unknown
- **License**: Apache-2.0
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2024-05-28
- **Last Updated**: 2024-05-28

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README


## 数据结构

> 数组

| 题号 | 难度 | 题目链接 | 答案链接 | 
| :--: | :--: | :--: | :--: |
| 11 | 中等 | [盛最多水的容器](https://leetcode-cn.com/problems/container-with-most-water) | [container-with-most-water](https://github.com/inrust/Rust-Programming-in-Action/tree/master/data-structure/array/leetcode_11_container-with-most-water/src/main.rs) |
| 26 | 简单 | [删除排序数组中的重复项](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array) | [remove-duplicates-from-sorted-array](https://github.com/inrust/Rust-Programming-in-Action/tree/master/data-structure/array/leetcode_26_remove-duplicates-from-sorted-array/src/main.rs) |
| 66 | 简单 | [加一](https://leetcode-cn.com/problems/plus-one) | [plus-one](https://github.com/inrust/Rust-Programming-in-Action/tree/master/data-structure/array/leetcode_66_plus-one/src/main.rs) | 
| 283 | 简单 | [移动零](https://leetcode-cn.com/problems/move-zeroes) | [move-zeroes_bug](https://github.com/inrust/Rust-Programming-in-Action/tree/master/data-structure/array/leetcode_283_move-zeroes_bug/src/main.rs)    [move-zeroes_bugfix](https://github.com/inrust/Rust-Programming-in-Action/tree/master/data-structure/array/leetcode_283_move-zeroes_bugfix/src/main.rs)    [move-zeroes_upgrade](https://github.com/inrust/Rust-Programming-in-Action/tree/master/data-structure/array/leetcode_283_move-zeroes_upgrade/src/main.rs) |

> 链表

| 题号 | 难度 | 题目链接 | 答案链接 | 
| :--: | :--: | :--: | :--: |
| 19 | 中等 | [删除链表的倒数第N个节点](https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list) | [remove-nth-node-from-end-of-list](https://github.com/inrust/Rust-Programming-in-Action/tree/master/data-structure/linked_list/leetcode_19_remove-nth-node-from-end-of-list/src/main.rs) |
| 21 | 简单 | [合并两个有序链表](https://leetcode-cn.com/problems/merge-two-sorted-lists) | [merge-two-sorted-lists](https://github.com/inrust/Rust-Programming-in-Action/tree/master/data-structure/linked_list/leetcode_21_merge-two-sorted-lists/src/main.rs) |
| 206 | 简单 | [反转链表](https://leetcode-cn.com/problems/reverse-linked-list) | [reverse-linked-list](https://github.com/inrust/Rust-Programming-in-Action/tree/master/data-structure/linked_list/leetcode_206_reverse-linked-list/src/main.rs) |
| 876 | 简单 | [链表的中间结点](https://leetcode-cn.com/problems/middle-of-the-linked-list) | [middle-of-the-linked-list](https://github.com/inrust/Rust-Programming-in-Action/tree/master/data-structure/linked_list/leetcode_876_middle-of-the-linked-list/src/main.rs) |

> 栈与队列

| 题号 | 难度 | 题目链接 | 答案链接 | 
| :--: | :--: | :--: | :--: |
| 20 | 简单 | [有效的括号](https://leetcode-cn.com/problems/valid-parentheses) | [valid-parentheses](https://github.com/inrust/Rust-Programming-in-Action/tree/master/data-structure/stack-queue/leetcode_20_valid-parentheses/src/main.rs) |
| 155 | 简单 | [最小栈](https://leetcode-cn.com/problems/min-stack) | [min-stack](https://github.com/inrust/Rust-Programming-in-Action/tree/master/data-structure/stack-queue/leetcode_155_min-stack/src/main.rs) |
| 239 | 困难 | [滑动窗口最大值](https://leetcode-cn.com/problems/sliding-window-maximum) | [sliding-window-maximum](https://github.com/inrust/Rust-Programming-in-Action/tree/master/data-structure/stack-queue/leetcode_239_sliding-window-maximum/src/main.rs) |

> 哈希表

| 题号 | 难度 | 题目链接 | 答案链接 | 
| :--: | :--: | :--: | :--: |
| 1  | 简单 | [两数之和](https://leetcode-cn.com/problems/two-sum) | [two-sum](https://github.com/inrust/Rust-Programming-in-Action/tree/master/data-structure/hashtable/leetcode_1_two-sum/src/main.rs)    [two-sum_upgrade](https://github.com/inrust/Rust-Programming-in-Action/tree/master/data-structure/hashtable/leetcode_1_two-sum_upgrade/src/main.rs) |
| 49 | 中等 | [字母异位词分组](https://leetcode-cn.com/problems/group-anagrams) | [group-anagrams](https://github.com/inrust/Rust-Programming-in-Action/tree/master/data-structure/hashtable/leetcode_49_group-anagrams/src/main.rs)    [group-anagrams_addition](https://github.com/inrust/Rust-Programming-in-Action/tree/master/data-structure/hashtable/leetcode_49_group-anagrams_addition/src/main.rs)    [group-anagrams_upgrade](https://github.com/inrust/Rust-Programming-in-Action/tree/master/data-structure/hashtable/leetcode_49_group-anagrams_upgrade/src/main.rs) |
| 242 | 简单 | [有效的字母异位词](https://leetcode-cn.com/problems/valid-anagram) | [valid-anagram](https://github.com/inrust/Rust-Programming-in-Action/tree/master/data-structure/hashtable/leetcode_242_valid-anagram/src/main.rs) |

> 树

| 数据结构 | 代码实现 | 
| :--: | :--: |
| 二叉树 | [Binary-Tree](https://github.com/inrust/Rust-Programming-in-Action/tree/master/data-structure/tree/binary_tree/src/main.rs) |
| 堆 | [Heap](https://github.com/inrust/Rust-Programming-in-Action/tree/master/data-structure/tree/heap/src/main.rs) |

| 题号 | 难度 | 题目链接 | 答案链接 | 
| :--: | :--: | :--: | :--: |
| 94 | 中等 | [二叉树的中序遍历](https://leetcode-cn.com/problems/binary-tree-inorder-traversal) | [binary-tree-inorder-traversal](https://github.com/inrust/Rust-Programming-in-Action/tree/master/data-structure/tree/leetcode_94_binary-tree-inorder-traversal/src/main.rs) |
| 102 | 中等 | [二叉树的层次遍历](https://leetcode-cn.com/problems/binary-tree-level-order-traversal) | [binary-tree-level-order-traversal](https://github.com/inrust/Rust-Programming-in-Action/tree/master/data-structure/tree/leetcode_102_binary-tree-level-order-traversal/src/main.rs) |
| 144 | 中等 | [二叉树的前序遍历](https://leetcode-cn.com/problems/binary-tree-preorder-traversal) | [binary-tree-preorder-traversal](https://github.com/inrust/Rust-Programming-in-Action/tree/master/data-structure/tree/leetcode_144_binary-tree-preorder-traversal/src/main.rs) |
| 145 | 困难 | [二叉树的后序遍历](https://leetcode-cn.com/problems/binary-tree-postorder-traversal) | [binary-tree-postorder-traversal](https://github.com/inrust/Rust-Programming-in-Action/tree/master/data-structure/tree/leetcode_145_binary-tree-postorder-traversal/src/main.rs) |
| 701 | 中等 | [二叉搜索树中的插入操作](https://leetcode-cn.com/problems/insert-into-a-binary-search-tree) | [insert-into-a-binary-search-tree](https://github.com/inrust/Rust-Programming-in-Action/tree/master/data-structure/tree/leetcode_701_insert-into-a-binary-search-tree/src/main.rs) |

## 算法
  
> 递归、分治与回溯

| 题号 | 难度 | 题目链接 | 答案链接 | 
| :--: | :--: | :--: | :--: |
| 22 | 中等 | [括号生成](https://leetcode-cn.com/problems/generate-parentheses) | [generate-parentheses](https://github.com/inrust/Rust-Programming-in-Action/tree/master/algorithm/divide-conquer-backtracking/leetcode_22_generate-parentheses/src/main.rs) | 
| 50 | 中等 | [Pow(x, n)](https://leetcode-cn.com/problems/powx-n) | [powx-n](https://github.com/inrust/Rust-Programming-in-Action/blob/master/algorithm/divide-conquer-backtracking/leetcode_50_powx-n/src/main.rs) | 
| 51 | 困难 | [N皇后](https://leetcode-cn.com/problems/n-queens) | [n-queens](https://github.com/inrust/Rust-Programming-in-Action/tree/master/algorithm/divide-conquer-backtracking/leetcode_51_n-queens/src/main.rs) | 
| 70 | 简单 | [爬楼梯](https://leetcode-cn.com/problems/climbing-stairs) | [climbing stairs](https://github.com/inrust/Rust-Programming-in-Action/tree/master/algorithm/divide-conquer-backtracking/leetcode_70_climbing-stairs/src/main.rs) | 
| 77 | 中等 | [组合](https://leetcode-cn.com/problems/combinations) | [combinations](https://github.com/inrust/Rust-Programming-in-Action/tree/master/algorithm/divide-conquer-backtracking/leetcode_77_combinations/src/main.rs) | 
| 78 | 中等 | [子集](https://leetcode-cn.com/problems/subsets) | [subsets](https://github.com/inrust/Rust-Programming-in-Action/tree/master/algorithm/divide-conquer-backtracking/leetcode_78_subsets/src/main.rs) | 

> 二分查找

| 题号 | 难度 | 题目链接 | 答案链接 | 
| :--: | :--: | :--: | :--: |
| 33 | 中等 | [搜索旋转排序数组](https://leetcode-cn.com/problems/search-in-rotated-sorted-array) | [search-in-rotated-sorted-array](https://github.com/inrust/Rust-Programming-in-Action/tree/master/algorithm/binary-search/leetcode_33_search-in-rotated-sorted-array/src/main.rs) | 
| 153 | 中等 | [寻找旋转排序数组中的最小值](https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array) | [find-minimum-in-rotated-sorted-array](https://github.com/inrust/Rust-Programming-in-Action/tree/master/algorithm/binary-search/leetcode_153_find-minimum-in-rotated-sorted-array/src/main.rs) | 
| 367 | 简单 | [有效的完全平方数](https://leetcode-cn.com/problems/valid-perfect-square) | [valid-perfect-square](https://github.com/inrust/Rust-Programming-in-Action/tree/master/algorithm/binary-search/leetcode_367_valid-perfect-square/src/main.rs) | 

> 深度与广度优先搜索

| 题号 | 难度 | 题目链接 | 答案链接 | 
| :--: | :--: | :--: | :--: |
| 104 | 简单 | [二叉树的最大深度](https://leetcode-cn.com/problems/maximum-depth-of-binary-tree) | [maximum-depth-of-binary-tree_dfs](https://github.com/inrust/Rust-Programming-in-Action/blob/master/algorithm/dfs-and-bfs/leetcode_104_maximum-depth-of-binary-tree_dfs/src/main.rs)     [maximum-depth-of-binary-tree_bfs](https://github.com/inrust/Rust-Programming-in-Action/blob/master/algorithm/dfs-and-bfs/leetcode_104_maximum-depth-of-binary-tree_bfs/src/main.rs) | 
| 111 | 简单 | [二叉树的最小深度](https://leetcode-cn.com/problems/minimum-depth-of-binary-tree) | [minimum-depth-of-binary-tree](https://github.com/inrust/Rust-Programming-in-Action/tree/master/algorithm/dfs-and-bfs/leetcode_111_minimum-depth-of-binary-tree/src/main.rs) | 
| 700 | 简单 | [二叉搜索树中的搜索](https://leetcode-cn.com/problems/search-in-a-binary-search-tree) | [search-in-a-binary-search-tree](https://github.com/inrust/Rust-Programming-in-Action/blob/master/algorithm/dfs-and-bfs/leetcode_700_search-in-a-binary-search-tree/src/main.rs) | 

> 排序

| 排序算法 | 代码实现 | 
| :--: | :--: |
| 冒泡排序 | [Bubble-Sort](https://github.com/inrust/Rust-Programming-in-Action/blob/master/algorithm/sort/bubble_sort/src/main.rs) |
| 插入排序 | [Insertion-Sort](https://github.com/inrust/Rust-Programming-in-Action/blob/master/algorithm/sort/insertion_sort/src/main.rs) |
| 选择排序 | [Selection-Sort](https://github.com/inrust/Rust-Programming-in-Action/blob/master/algorithm/sort/selection_sort/src/main.rs) |
| 堆排序 | [Heap-Sort](https://github.com/inrust/Rust-Programming-in-Action/blob/master/algorithm/sort/heap_sort/src/main.rs) |
| 归并排序 | [Merge-Sort](https://github.com/inrust/Rust-Programming-in-Action/blob/master/algorithm/sort/merge_sort/src/main.rs) |
| 快速排序 | [Quick-Sort](https://github.com/inrust/Rust-Programming-in-Action/blob/master/algorithm/sort/quick_sort/src/main.rs) |

| 题号 | 难度 | 题目链接 | 答案链接 | 
| :--: | :--: | :--: | :--: |
| 56 | 中等 | [合并区间](https://leetcode-cn.com/problems/merge-intervals) | [merge-intervals](https://github.com/inrust/Rust-Programming-in-Action/tree/master/algorithm/sort/leetcode_56_merge-intervals/src/main.rs) | 
| 215 | 中等 | [数组中的第K个最大元素](https://leetcode-cn.com/problems/kth-largest-element-in-an-array) | [kth-largest-element-in-an-array](https://github.com/inrust/Rust-Programming-in-Action/tree/master/algorithm/sort/leetcode_215_kth-largest-element-in-an-array/src/main.rs) | 
| 493 | 困难 | [翻转对](https://leetcode-cn.com/problems/reverse-pairs) | [reverse-pairs](https://github.com/inrust/Rust-Programming-in-Action/tree/master/algorithm/sort/leetcode_493_reverse-pairs/src/main.rs) | 

> 动态规划

| 题号 | 难度 | 题目链接 | 答案链接 | 
| :--: | :--: | :--: | :--: |
| 64 | 中等 | [最小路径和](https://leetcode-cn.com/problems/minimum-path-sum) | [minimum-path-sum](https://github.com/inrust/Rust-Programming-in-Action/blob/master/algorithm/dynamic_programming/leetcode_64_minimum-path-sum/src/main.rs) |
| 70 | 简单 | [爬楼梯](https://leetcode-cn.com/problems/climbing-stairs) | [climbing stairs](https://github.com/inrust/Rust-Programming-in-Action/blob/master/algorithm/dynamic_programming/leetcode_70_climbing-stairs/src/main.rs) |
| 72 | 困难 | [编辑距离](https://leetcode-cn.com/problems/edit-distance) | [edit-distance](https://github.com/inrust/Rust-Programming-in-Action/blob/master/algorithm/dynamic_programming/leetcode_72_edit-distance/src/main.rs) |
| 120 | 中等 | [三角形最小路径和](https://leetcode-cn.com/problems/triangle) | [triangle](https://github.com/inrust/Rust-Programming-in-Action/blob/master/algorithm/dynamic_programming/leetcode_120_triangle/src/main.rs) |
| 300 | 中等 | [最长上升子序列](https://leetcode-cn.com/problems/longest-increasing-subsequence) | [longest-increasing-subsequence](https://github.com/inrust/Rust-Programming-in-Action/blob/master/algorithm/dynamic_programming/leetcode_300_longest-increasing-subsequence/src/main.rs) |
| 322 | 中等 | [零钱兑换](https://leetcode-cn.com/problems/coin-change) | [coin-change](https://github.com/inrust/Rust-Programming-in-Action/blob/master/algorithm/dynamic_programming/leetcode_322_coin-change/src/main.rs) |