算法面试题整理:以 LeetCode / LintCode 为主,按数据结构与解题模式(pattern)分类,每题包含题目描述、思路和 Java 题解。 Algorithm interview problems, mainly LeetCode / LintCode, organized by data structure and pattern, each with a walkthrough and a Java solution.
🌐 在线阅读 / Read online:https://whicter.github.io/leetcode-java/(左侧目录导航 · 全文搜索 · 深色模式)
| 分类 Section | 篇数 Pages | 题数 Problems | 入口 Start here |
|---|---|---|---|
| Data Structure | 67 | 55 | Array Binary Tree Hash (HashMap) Heap (PriorityQueue) LinkedList Stack String |
| BFS & DFS | 15 | 12 | BFS DFS Backtracking |
| Bit Manipulation | 5 | 4 | Bit Summary |
| Dynamic Programming | 16 | 15 | DP-Summary |
| Search & Sort | 19 | 16 | Binary Search Union Find Topological Sort |
| Two Pointers | 8 | 7 | Two Pointers Summary |
| Design | 19 | 3 | OO Design System Design |
完整目录见 SUMMARY.md,网站左侧导航与它一致。