2014年3月1日
Unique Binary Search Tree
摘要： Givenn, how many structurally uniqueBST's(binary search trees) that store values 1...n?For example,Givenn= 3, there are a total of 5 unique BST's. 1 3 3 2 1 \ / / / \ \ 3 2 1 1 3 2 / / \ \ 2 1 ... 阅读全文
posted @ 2014-03-01 22:09 Awy 阅读(155) 评论(0) 推荐(0) 编辑
Best Time to Buy and Sell sock II
摘要： Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at 阅读全文
posted @ 2014-03-01 09:44 Awy 阅读(282) 评论(0) 推荐(0) 编辑