摘要:
Givenn, generate all structurally uniqueBST's(binary search trees) that store values 1...n.ExampleGivenn= 3, your program should return all 5 unique B... 阅读全文
摘要:
Given n, how many structurally unique BSTs (binary search trees) that store values 1...n?ExampleGiven n = 3, there are a total of 5 unique BST's.1 ... 阅读全文
摘要:
Given an integer array, find a continuous subarray where the sum of numbers is the biggest. Your code should return the index of the first number and ... 阅读全文