随笔分类 -  算法学习

个人求职所遇到的算法
树的非递归前序、中序、后序遍历
摘要：#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 阅读(291) 评论(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 阅读(255) 评论(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 阅读(136) 评论(0) 推荐(0)
输入一个链表，从尾到头打印链表每个节点的值。
摘要：从尾到头，可以通过栈临时存储： 阅读全文
posted @ 2017-03-01 21:29 Forever-Road 阅读(561) 评论(0) 推荐(0)
输入某二叉树的前序遍历和中序遍历的结果，请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6}，则重建二叉树并返回。
摘要：该文章转载于：http://www.cnblogs.com/wdan2016/p/5988560.html // test20.cpp : 定义控制台应用程序的入口点。// 阅读全文
posted @ 2017-03-01 21:24 Forever-Road 阅读(324) 评论(0) 推荐(0)