实践&理论
easy
- 69：sqrt(x)
- 278：firstBadVersion(n)
- 35: search insert position
- 374: guess number higher or lower
- 349: intersection of two arrays
- 350: intersection of two arrays ii
medium
- 33: search in sorted array
- 81: search in rotated sorted array ii
- 153: find minimum in rotated sorted array
- 162: find peak element
- 34: find first and last position of element in sorted array
- 300: longest increasing subsequence
hard
- 154: find minimum in rotated sorted array ii
- 315: count of smaller numbers after self
- 354: russian doll envelopes
- 冒泡排序
- 插入排序
- 选择排序
- 归并排序
- 桶排序
- 计数排序
- 基数排序
easy
- 28: Implement strStr()
- 707: Design Linked List
- 206: Reverse Linked List
- 141: Linked List cycle
- 24: swap Nodes in Pairs
- 232: Implement Queue using stacks
- 20: valid parentheses
- 225: Implement Stack using Queue
- 实现跳表
- 实现hash Table
medium
- 208: implement trie (prefix tree)
- 79: word search
hard
- 212: word search ii
easy
- 104: maximum depth of binary tree
- 111: minimum depth of binary tree
- 235: lowest common ancestor of a binary search tree
- 226: invert binary tree
- 112: path sum
medium
- 102: binary tree level order traversal
- 236: lowest common ancestor of a binary tree
- 98: validate binary search tree
- 863: all nodes distance k in binary tree
easy
- 703: Kth Largest Element in a Stream(求top-K)
hard
- 4: Median of Two Sorted Arrays(求中位数)
- 239: Sliding Window Maximum(返回滑动窗口的最大值)
- 215. Kth Largest Element in an Array
- 200: number of islands
- 36. Valid Sudoku
- 1: 请分别用深度优先思想和广度优先思想实现一个拷贝函数
- 2: 要求设计 LazyMan 类，实现以下功能
LazyMan('Tony');
// Hi I am Tony
LazyMan('Tony').sleep(10).eat('lunch');
// Hi I am Tony
// 等待了10秒...
// I am eating lunch
LazyMan('Tony').eat('lunch').sleep(10).eat('dinner);
// Hi I am Tony
// I am eating lunch
// 等待了10秒
// I am eating dinner
LazyMan('Tony).eat('lunch').eat('dinner').sleepFirst(5).sleep(10).eat('junk food')
// Hi I am Tony
// 等待了5秒
// I am eating lunch
// I am eating dinner
// 等待了10秒
// I am eating junk food
- 3: 介绍下
Set、Map、WeakSet、WeakMap的区别
持续更新...