yanrui92的专栏

Given n, generate all structurally unique BST's (binary search trees) that store values 1...n. For example, Given n = 3, your program should return all 5 unique BST's shown below. public class

Climbing Stairs  Total Accepted: 36520 Total Submissions: 107274My Submissions Question  Solution  You are climbing a stair case. It takes n steps to reach to the top. Each time you

Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.) You have the following 3 operations permitted on a word: