2016年9月27日
Buy and sell stocks 总结
摘要： buy and sell stocks 在leetcode现在总共有5 道题。 Best Time to Buy and Sell Stock 这道题是基础，只能transaction一次，所以我们用 Best Time to Buy and Sell Stock II 这道题表示可以一直trans 阅读全文
posted @ 2016-09-27 12:56 咖啡中不塌缩的方糖 阅读(169) 评论(0) 推荐(0) 编辑
404. Sum of Left Leaves
摘要： Find the sum of all left leaves in a given binary tree. Example: Iteration: 阅读全文
posted @ 2016-09-27 03:26 咖啡中不塌缩的方糖 阅读(164) 评论(0) 推荐(0) 编辑
76. Minimum Window Substring
摘要： Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). For example,S = "ADOBECOD 阅读全文
posted @ 2016-09-27 03:02 咖啡中不塌缩的方糖 阅读(172) 评论(0) 推荐(0) 编辑