#面试刷题
该标签下的全部文章。
Unique Binary Search Trees II
Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.
Unique Binary Search Trees
Given n, how many structurally unique BST's (binary search trees) that store values 1...n?
Valid Binary Search Tree
Check if a binary tree is a Binary Search Tree (BST), you may assume there is no element having same value.
Word Ladder II
Given two words (beginWord and endWord), and a dictionary's word list, find all shortest transformation sequen
Word Ladder
Given two words (start and end), and a dictionary of words, find the length of shortest sequences of words fro
Zigzag Level Order Traversal
Given a binary tree, return the zigzag level order traversal of its nodes' values.
Binary Search
给定一个排序的整数数组（升序）和一个要查找的整数 target，用O(logn)的时间查找到target第一次出现的下标（从0开始），如果target不存在于数组中，返回-1。