LeetCode
- 基于Java的leetcode解题记录
- Jdk version: Jdk 11
- 争取把所有leetcode的题都解完,部分题可能有多种解法
1. Folder description
Folder | Description |
---|---|
solution | 包括个人解题所写的java源文件 Including java source files written by myself |
problem | 内含对问题题干描述的md文件 Including markdown files containing description of leetcode problems |
reference | 附有leetcode提供的参考解法或者耗时较短的解法等 Including reference solutions provided by leetcode |
2. Tag list
# | Tag | Problem folder | Solution folder | Reference folder |
---|---|---|---|---|
01 | Array | Go | Go | Go |
02 | Hash Table | Go | Go | Go |
03 | Linked List | Go | Go | Go |
04 | Math | Go | Go | Go |
05 | Two Pointers | Go | Go | Go |
06 | String | Go | Go | Go |
07 | Binary Search | Go | Go | |
08 | Divide and Conquer | Go | Go | |
09 | Dynamic Programming | Go | Go | |
10 | Backtracking | Go | Go | |
11 | Stack | Go | Go | |
12 | Heap | Go | Go | |
13 | Greedy | Go | Go | |
14 | Sort | Go | Go | |
15 | Bit Manipulation | Go | Go | |
16 | Tree | Go | Go | |
17 | Depth-first Search | Go | Go | Go |
18 | Breadth-first Search | Go | Go | |
19 | Union Find | Go | Go | |
20 | Graph | Go | Go | |
21 | Design | Go | Go | |
22 | Topological Sort | Go | Go | |
23 | Trie | Go | Go | |
24 | Binary Indexed Tree | Go | Go | |
25 | Segment Tree | Go | Go | |
26 | Binary Search Tree | Go | Go | |
27 | Recursion | Go | Go | |
28 | Brainteaser | Go | Go | |
29 | Memoization | Go | Go | |
30 | Queue | Go | Go | |
31 | Minimax | Go | Go | |
32 | Reservoir Sampling | Go | Go | |
33 | Map | Go | Go | |
34 | Geometry | Go | Go | |
35 | Random | Go | Go | |
36 | Rejection Sampling | Go | Go |
Note:
Click tag to jump to the corresponding markdown file, through which you can find the problem you want.