# beihu-leetcode

**Repository Path**: beihu-stack/beihu-leetcode

## Basic Information

- **Project Name**: beihu-leetcode
- **Description**: LeetCode Algorithm
- **Primary Language**: Java
- **License**: Apache-2.0
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2021-09-14
- **Last Updated**: 2021-09-14

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

# Beihu-LeetCode
##### LeetCode Algorithm



##### 数据结构

- Array
- Stack
- LinkedList
- Queue/PriorityQueue(heap)
- Set/Disjoint Set
- Map/HashTable
- Tree/Binary Search Tree/Spanning tree
- Trie 字母树
- BloomFilter
- LRU Cache



##### 算法

- Sorting 排序算法
- Graph 图
- Hashing 哈希
- Greedy 贪婪算法
- Resursion/Backtrace  递归/回溯
- Traversal  遍历   前中后序(In-Order/Pre-Order/Post-Order)
- Breadth-first/Depth-first search  广度优先、深度优先
- Divide and Conquer  分而治之
- Dynamic Programming 动态规划
- Binary Search 二分法查询
- Graph 图

​    

##### 解题思路

- 明确题意 Clarification
- 可能解 Possible Solutions
  - comare(time/space) 最优解
  - optimal 
- Coding 多写
- Test cases



##### 复杂度

- 时间
- 空间

![image-20200710221850203](assets/image-20200710221850203.png) 



![bigo](assets/bigo.png)

​    

##### Big O notation

- O(1) 常数复杂度
- O(logn) 对数复杂度： 二分查找法
- O(n) 线性复杂度 ：二叉树遍历（每个节点只遍历一次）   ，排序(Optimal sorted matrix search)
- o(nlogn) 线性对数复杂度：快排，归并排序
-  O(n^2) 平方 ： 斐波那契
- O(n^3) 立方
- O(2^n) 指数
- O(n!) 阶乘



##### Master Theorem (主定理)

![image-20200710231353076](assets/image-20200710231353076.png)



![image-20200711002020859](assets/image-20200711002020859.png)

![image-20200711002037755](assets/image-20200711002037755.png)

![image-20200711002057379](assets/image-20200711002057379.png)

![image-20200711002115437](assets/image-20200711002115437.png)

![image-20200711002128704](assets/image-20200711002128704.png)

![image-20200711002141954](assets/image-20200711002141954.png)

![image-20200711002152075](assets/image-20200711002152075.png)