Tony's Log

Algorithms, Distributed System, Machine Learning
  博客园 :: 首页 :: 博问 :: 闪存 :: 新随笔 :: 联系 :: 订阅 订阅 :: 管理 ::

2014年7月17日

LeetCode "Validate Binary Search Tree"
摘要： This is to test your knowledge on BST and its traversal.Flatting BST into an array using in-order, and check that array. It is that simple:class Solut... 阅读全文
posted @ 2014-07-17 15:44 Tonix 阅读(145) 评论(0) 推荐(0)

LeetCode "Triangle"
摘要： This is the same asSPOJ #453. The best way to understand DP1A code:class Solution {public: int minimumTotal(vector > &triangle) { fo... 阅读全文
posted @ 2014-07-17 06:21 Tonix 阅读(145) 评论(0) 推荐(0)

LeetCode "Sum Root to Leaf Numbers"
摘要： A typical DFS usage, no big deal:class Solution {public: int dfs(TreeNode *p, int pval) { if( !p->left && !p->right ) { ... 阅读全文
posted @ 2014-07-17 05:27 Tonix 阅读(151) 评论(0) 推荐(0)