CLRS
Tongust
这个作者很懒,什么都没留下…
展开
-
算法导论第三版-课后习题-自解
关于答案算法导论课后习题是没有官方版的,虽然可以在https://mitpress.mit.edu/sites/default/files/titles/content/Intro_to_Algo_Selected_Solutions.pdf 中找到官方给的部分答案。按照Cormen的解释,为了讲师布置作业,官方并未公布所有的答案,以便学生自己解答。前十一章答案(仅供参考)俄罗斯一原创 2015-08-24 17:39:35 · 11677 阅读 · 0 评论 -
Build Binary Search Tree
/* LeetCode 536. Construct Binary Tree from String* * You need to construct a binary tree from a string consisting of parenthesis and integers.* * The whole input represents a binary tree. It conta原创 2017-04-15 16:26:13 · 256 阅读 · 0 评论 -
Heap-Find Median from Data Stream
Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle value.Examples: [2,3,4] , the median is 3原创 2017-04-15 22:22:33 · 261 阅读 · 0 评论 -
The solution on the Elements of Statistical Learning
统计学习基础 第二版 参考答案原创 2016-12-17 15:22:50 · 4245 阅读 · 0 评论 -
Leetcode-List-Hash
Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and put.get(key) - Get the value (will always be positive) of the key if the k原创 2017-04-20 23:16:18 · 207 阅读 · 0 评论 -
BST 遍历
递归遍历pre_order// 递归先序遍历 void rpre_order(btree* tree) { btNode * p = tree; if (NULL == p) { return; } cout << p->data << " "; rpre_order(p->left); rpre_or转载 2017-04-23 10:41:35 · 303 阅读 · 0 评论