2015年2月18日
[LeetCode] Best Time to Buy and Sell Stock IV 买卖股票的最佳时间之四
摘要： 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 @ 2015-02-18 14:36 Grandyang 阅读(40713) 评论(2) 推荐(2) 编辑
[LeetCode] Convert Sorted List to Binary Search Tree 将有序链表转为二叉搜索树
摘要： Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced bina 阅读全文
posted @ 2015-02-18 07:54 Grandyang 阅读(16762) 评论(11) 推荐(0) 编辑
Fork me on GitHub