2020年9月21日
[LeetCode] 538. Convert BST to Greater Tree
摘要： Given the root of a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus 阅读全文
posted @ 2020-09-21 13:23 CNoodle 阅读(235) 评论(0) 推荐(0)
[LeetCode] 714. Best Time to Buy and Sell Stock with Transaction Fee
摘要： You are given an array prices where prices[i] is the price of a given stock on the ith day, and an integer fee representing a transaction fee. Find th 阅读全文
posted @ 2020-09-21 11:39 CNoodle 阅读(172) 评论(0) 推荐(0)
[LeetCode] 309. Best Time to Buy and Sell Stock with Cooldown
摘要： You are given an array prices where prices[i] is the price of a given stock on the ith day. Find the maximum profit you can achieve. You may complete 阅读全文
posted @ 2020-09-21 05:48 CNoodle 阅读(391) 评论(0) 推荐(0)