摘要：
Firt thought: an variation to LCS problem - but this one has many tricky detail. I learnt the solution from this link:https://github.com/wangyongliang 阅读全文
posted @ 2016-06-18 09:09
Tonix
阅读(362)
评论(0)
推荐(0)
摘要：
Queue + hashset 阅读全文
posted @ 2016-06-17 05:44
Tonix
阅读(339)
评论(0)
推荐(0)
摘要：
Greedy using priority_queue and hashmap. The basic idea is to have k buckets - and we fill it greedily. And I agree that the code below can be cleaner 阅读全文
posted @ 2016-06-15 06:49
Tonix
阅读(218)
评论(0)
推荐(0)
摘要：
First you find the Y, and then do a pairing game - hashtable is good. class Solution { public: bool isReflected(vector<pair<int, int>>& points) { int 阅读全文
posted @ 2016-06-15 05:40
Tonix
阅读(225)
评论(0)
推荐(0)
摘要：
An intuitive DP - should be 'medium'. 阅读全文
posted @ 2016-06-07 06:20
Tonix
阅读(286)
评论(0)
推荐(0)
摘要：
BFS solution is intuitive - here I will show a DFS based solution: 阅读全文
posted @ 2016-06-05 10:05
Tonix
阅读(119)
评论(0)
推荐(0)
摘要：
Problem Reason Reference Moving ZeroesSort Colors Corner cases Shortest Word Distance Thought: 2 ptr chasing Merge 2 sorted ListsRemove Linked List El 阅读全文
posted @ 2016-05-18 09:34
Tonix
阅读(128)
评论(0)
推荐(0)
摘要：
Kruskal Algorithm is based on Union-Find - quite intuitive. 阅读全文
posted @ 2016-05-11 13:52
Tonix
阅读(326)
评论(0)
推荐(0)
摘要：
An intuitive Prim algorithm impl. 阅读全文
posted @ 2016-05-11 07:14
Tonix
阅读(276)
评论(0)
推荐(0)
摘要：
We don't have to keep a complete chess board.. just counters! 阅读全文
posted @ 2016-05-07 14:05
Tonix
阅读(302)
评论(0)
推荐(0)
摘要：
Two tricks here: 1. Counting no. of inversed pairs - using Merge Sort, nothing special 2. How to check 'chaotic'? We simply check if any number is ove 阅读全文
posted @ 2016-05-07 13:30
Tonix
阅读(603)
评论(0)
推荐(0)
摘要：
A typical solution is heap based - "top K". Complexity is O(nlgk). There is a O(n) one indeed - bucketing the frequencies.https://leetcode.com/discuss 阅读全文
posted @ 2016-05-03 09:19
Tonix
阅读(187)
评论(0)
推荐(0)
摘要：
A typical CS style DP based solution: But there's a Math based solution: https://leetcode.com/discuss/98249/easy-to-understand-c-with-explanationIn wh 阅读全文
posted @ 2016-04-20 07:15
Tonix
阅读(124)
评论(0)
推荐(0)
摘要：
Fun one! A combination of Greedy and DP. The solution sparkled in my mind - I almost lost it.. Greedy: we sort the input numbers and always pick k con 阅读全文
posted @ 2016-04-15 13:31
Tonix
阅读(535)
评论(2)
推荐(0)
摘要：
It's more of a brain-teaser than a Game Theory problem.. 阅读全文
posted @ 2016-04-15 11:53
Tonix
阅读(265)
评论(0)
推荐(0)
摘要：
It is about how to choose btw. BFS and DFS. My init thought was to DFS - TLE\MLE. And its editorial gives a very neat BFS based idea which costs much 阅读全文
posted @ 2016-04-14 13:56
Tonix
阅读(395)
评论(0)
推荐(0)
摘要：
I caught the sparkle in my mind and got AC1 ! It is a great great experience ! So the basic idea: permute on 3 consecutive items doesn't change the pa 阅读全文
posted @ 2016-04-13 04:40
Tonix
阅读(411)
评论(0)
推荐(0)
摘要：
It is marked as a NPC problem. However from the #1 code submission (https://www.hackerrank.com/CharlesOfria), it looks pretty much like a Brutal-Force 阅读全文
posted @ 2016-04-12 05:39
Tonix
阅读(389)
评论(0)
推荐(0)
摘要：
I saw the same sub-problem in LeetCode, and there exists a O(n) neat greedy solution: Please note: '[' is the first char after 'Z'. 阅读全文
posted @ 2016-04-08 03:13
Tonix
阅读(319)
评论(0)
推荐(0)
摘要：
Typical topological sorting problem .. why is it 'difficult'? 阅读全文
posted @ 2016-04-08 02:26
Tonix
阅读(245)
评论(0)
推荐(0)
浙公网安备 33010602011771号