Fork me on GitHub
摘要: Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may comple 阅读全文
posted @ 2017-03-02 20:29 hellowOOOrld 阅读(164) 评论(0) 推荐(0) 编辑
摘要: Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction 阅读全文
posted @ 2017-03-02 12:55 hellowOOOrld 阅读(227) 评论(0) 推荐(0) 编辑
摘要: Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For example: Given the below binary tree and su 阅读全文
posted @ 2017-03-02 10:08 hellowOOOrld 阅读(168) 评论(0) 推荐(0) 编辑