Tony's Log

Algorithms, Distributed System, Machine Learning

  博客园 :: 首页 :: 新随笔 :: 联系 :: 订阅 :: 管理 ::

随笔分类 -  On Textbook

摘要:The latest article from InterviewCake is about a very neat & elegant algorithm: Fisher-Yates shuffle algorithm Q: how to shuffle an array - in-place? 阅读全文
posted @ 2018-02-15 05:45 Tonix 阅读(199) 评论(0) 推荐(0)

摘要:The code below is for:http://hihocoder.com/problemset/solution/237010With enough comments to understand:#include #include #include #include #include #... 阅读全文
posted @ 2015-03-25 02:03 Tonix 阅读(174) 评论(0) 推荐(0)

摘要:http://www.cnblogs.com/grenet/p/3145800.htmlBest elaboration on dancing list I found. in Chinese.Traditional backtracing is a heuristic-like procedure... 阅读全文
posted @ 2015-03-05 07:38 Tonix 阅读(162) 评论(0) 推荐(0)

摘要:Details not refined yet..struct Ret{ Ret(TreeNode *p, Mask rm) : pVal(p), m(rm){} TreeNode *pVal; Mask m;};class Solution {public: Ret lca... 阅读全文
posted @ 2015-01-27 06:39 Tonix 阅读(199) 评论(0) 推荐(0)

摘要:One TopCoder article introduces a very interesting alternative solution to Longest Common Sequences problem.It is based on this statement (http://comm... 阅读全文
posted @ 2014-12-20 09:40 Tonix 阅读(298) 评论(0) 推荐(0)

摘要:#include #include #include #include #include #include #include using namespace std;void insertSort(int A[], int cnt, int step = 1){ if (cnt 0 && A... 阅读全文
posted @ 2014-11-03 16:07 Tonix 阅读(141) 评论(0) 推荐(0)