February 8, 2016
It is always very
important to write some code and then get the experience to master a new
algorithm.
Leetcode 295: Find
Segmentfault.com article about median algorithm
- great algorithm discussion about median algorithm design using two heaps - one max heap, one min heap, in Chinese language.
Julia gist about code
Leetcode 295 solution blog by buttercola
Julia, read Java priorityQueue class and get some ideas about the class design:
programcreek.com priority queue class example
stackoverflow - how do I use a priority queue in java
understand priority queue first, read the lecture notes:
WSU.edu heap lecture notes
To be continued.
Follow up after 12 months
April 3, 2017Work on heap as a data structure.
No comments:
Post a Comment