11 2015 档案

leetcode Best Time to Buy and Sell Stock with Cooldown
摘要：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 a... 阅读全文
posted @ 2015-11-27 18:17 hr_whisper 阅读(242) 评论(0) 推荐(0)
leetcode Minimum Height Trees
摘要：For a undirected graph with tree characteristics, we can choose any node as the root. The result graph is then a rooted tree. Among all possible roote... 阅读全文
posted @ 2015-11-26 20:49 hr_whisper 阅读(168) 评论(0) 推荐(0)
本博客是从我CSDN上同步过来的
摘要：新 blog : www.hrwhisper.me 阅读全文
posted @ 2015-11-15 09:40 hr_whisper 阅读(214) 评论(0) 推荐(0)
推广一下新Blog www.hrwhisper.me
摘要：新博客地址：www.hrwhisper.me欢迎互访加友链~ 阅读全文
posted @ 2015-11-15 08:10 hr_whisper 阅读(569) 评论(0) 推荐(0)