暑假刷题mark一下

Day 9
Google foo bar challenge
Level 3 -2 && -3  Still by Python

Contains Duplicate
Contains Duplicate II

Day 10
Contains Duplicate III -- TreeSet && Bucket
Split BST

Concept:
Bin Sort, TreeSet, Red Black Tree, Splay Tree, AA-Tree, Treap, K-D Tree

Day 11 . DFS:

Closest Binary Search Tree Value -- ite && rec
Two Sum IV - Input is a BST -- w/out hashset
Closest Binary Search Tree Value II -- lgN + K && O(N) w/ LinkedList && O(lgK*N) w/ Heap && O(K*lgN)

Day 12

Binary Tree Paths
Flatten Binary Tree to Linked List -- ite && rec && DFS
Kth Smallest Element in a BST -- ite && rec
Binary Search Tree Iterator -- stack
Subtree with Maximum Average (!!!!!! Double.MIN_VALUE is a positive number!!!!!!!)
Ugly Number II -- w/ 3 queue
Inorder Successor in BST -- rec && ite
Lowest Common Ancestor of a Binary Search Tree
Lowest Common Ancestor of a Binary Tree

Day 13

Search Range in Binary Search Tree
Trim a Binary Search Tree -- rec && ite
Recover Binary Search Tree -- ite && rec
Insert Node in a Binary Search Tree -- ite
Consistent Hashing
Convert Sorted Array to Binary Search Tree
Convert Sorted List to Binary Search Tree -- O(NlgN) && O(N)

Day 14

Permutations
Next Permutation
Permutations II -- used[] && get next permutation
Permutation Sequence
Permutation Index

刷了几天公开课又回来刷题

Day 15

Two Pointer:
Shortest Subarray with Sum at Least K
Reverse String
Reverse String II
Reverse Words in a String III
Container With Most Water
Move Zeroes
3Sum
Merge Sorted Array
Remove Element -- same dir && diff dir
Trapping Rain Water

楼主用什么材料看基础概念啊

sjzyjc 发表于 2018-7-3 11:40
楼主用什么材料看基础概念啊

基础的话去看看Princeton的算法书，不需要特别深入，基础的概念理解了就够刷题了。另外就是结合document了。或者你习惯看中文的话，找找国内的数据结构的书也可以。

Day 16

Two Pointer cont.
Palindrome Linked List
Intersection of Two Arrays
Intersection of Two Arrays II -- sorted 2 pointer  && hashmap
Reverse Vowels of a String
3Sum Closest
Remove Nth Node From End of List
Find the Duplicate Number  ~~ LinkedList Cycle II