06 2017 档案

树的非递归前序、中序、后序遍历
摘要：#include #include #include #include #include using namespace std; struct TreeNode { int val; TreeNode *left; TreeNode *right; TreeNode(int x) : val(x), left(NULL), right... 阅读全文
posted @ 2017-06-16 10:37 Forever-Road 阅读(297) 评论(0) 推荐(0)
binary-tree-maximum-path-sum
摘要：Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. For exmple:Given the below binary tree, Return6. 翻 阅读全文
posted @ 2017-06-10 10:57 Forever-Road 阅读(259) 评论(0) 推荐(0)
best-time-to-buy-and-sell-stock
摘要：Say you have an array for which the i th element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may compl 阅读全文
posted @ 2017-06-10 10:47 Forever-Road 阅读(141) 评论(0) 推荐(0)