LeetCode

关于格式的说明

1. 题目都以四位数字开头，以便文件可以按照题目的顺序排列，比如0001.Two_Sum.md。

1. LC Log

Log

2. Data Structure专题

• Array -- TODO
• Tree
• Stack & Queue
  • Stack
  • Queue
• Array(fixed), Dynamic array
• Linked List
• TreeSet/TreeMap (ordered)
• HashSet/HashMap(unordered)
• Heap/PriorityQueue
• Deque/Queue/Stack
• Pair/Tuple
• Customized data structure
• String
• Heap
• Graph
• Trie

3. Algorithm专题

• 排序, Sort
• Recursion
  • Memorization
  • Divide and Conquer
  • Backtracking
• [Two Pointer](log_problems.md/#Sliding-Window-+-Two Pointers)
• Binary Search
• Dynamic Programming
• Greedy
• Bit Manipulation
• Depth-First Search
• Breadth-First Search
• Union Find
• Topological Sort
• Sliding Window
• Sampling
• Math(数学)
• Quick Search & Quick Sort

4. Company

• Google_OA
• Google_LC

5. 经典题目系列

✅ 1.Basic Calculators

1. CNoodle [LeetCode] 224. Basic Calculator
2. CNoodle [LeetCode] 227. Basic Calculator II
3. CNoodle [LeetCode] 772. Basic Calculator III
4. Java - Common template for Basic Calculator I, II, and III using Stack

2. Range Sum Query

1. 303. Range Sum Query - Immutable
2. 307. Range Sum Query - Mutable
3. 304.Range Sum Query 2D - Immutable
4. 308. Range Sum Query 2D - Mutable

3. K-th Smallest/Largest Element

• 378. Kth Smallest Element in a Sorted Matrix

4. Word Search

• 79. Word Search
  • 489. Robot Room Cleaner
• 212. Word Search II

5. Trie 字典树

• 208. Implement Trie (Prefix Tree)
  • CNoodle: [LeetCode] 208. Implement Trie (Prefix Tree)
• 211. Design Add and Search Words Data Structure
  • CNoodle: [LeetCode] 211. Design Add and Search Words Data Structure

6. Sliding Window

• 248 Count Number of Nice Subarrays
• 234 Replace the Substring for Balanced String
• 004 Max Consecutive Ones III
• 930 Binary Subarrays With Sum
• 992 Subarrays with K Different Integers
• 904 Fruit Into Baskets
• 862 Shortest Subarray with Sum at Least K
• 209 Minimum Size Subarray Sum
• 76 Minimum Window Substring

7. Balanced Search Tree

• 108. Convert Sorted Array to Binary Search Tree
• 109. Convert Sorted List to Binary Search Tree
• 1382. Balance a Binary Search Tree

8. Word Break

• ✅ 139. Word Break
• 140. Word Break II
  • Java Common template - Word Break I, Word Break II, Concatenated Words

9. Serialize and Deserialize

• 297. Serialize and Deserialize Binary Tree
• 428. Serialize and Deserialize N-ary Tree
• 449. Serialize and Deserialize BST
• 431. Encode N-ary Tree to Binary Tree

10. Lowest Common Ancestor

• 865. Smallest Subtree with all the Deepest Nodes
• 1123. Lowest Common Ancestor of Deepest Leaves

✅ 要掌握的Java Core API

• Class java.lang.Math
• Class java.util.Random
• Class java.lang.String
• Interface java.lang.Comparable
  • T - the type of objects that this object may be compared to.
  • int compareTo(T o) - Compares this object with the specified object for order. ⚠️注意: 要返回的类型为int

Templates

1. Basic Calculators
2. Next Greater Element
3. Trapping Rain Water (Stack, LC 42，84，85)
4. Lowest Common Ancestor

代码规范

• Google Java Style Guide
• Alibaba-Java-Coding-Guidelines
• Java开发手册(阿里)
• Java开发手册(黄山版) [2022.02.03]

Others

• Working with Java Empty String: A Detailed Guide

有用信息

• Leetcode 总结
  • http://darkalexwang.github.io/2018/05/14/Leetcode-%E6%80%BB%E7%BB%93/
• 美國軟體工程師求職心得
• GYee/CV_interviews_Q-A
• bhaveshAn/leetcode
• 胖头龙的咸鱼刷题笔记-算法篇
• 博客园 CNoodle Let the code speak for you.

Reference

• What are the environments for the programming languages?
  • Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.
• Google Drive, LeetCode打卡记录
• CNoodle, LeetCode题目总结
• CNoodle, LeetCode题目总结, 腾讯文档
• 一亩三分地: [其他] 关于算法的一点总结
• 【小小福讲算法】硅谷工程师十五分钟带你深入理解 Recursion （递归）算法，及其衍生出的算法（分治算法Divide and Conquer, 回溯 Backtracking）
• LeetCode in Go
• LeetCode 101：和你一起你轻松刷题（C++）