2015年6月29日
[LintCode] Find the Weak Connected Component in the Directed Graph
摘要： Find the Weak Connected Component in the Directed GraphFind the number Weak Connected Component in the directed graph. Each node in the graph contains... 阅读全文
posted @ 2015-06-29 13:34 Eason Liu 阅读(1431) 评论(0) 推荐(0)
[LeetCode] Majority Element II
摘要： Majority Element IIGiven an integer array of sizen, find all elements that appear more than⌊ n/3 ⌋times. The algorithm should run in linear time and i... 阅读全文
posted @ 2015-06-29 10:44 Eason Liu 阅读(266) 评论(0) 推荐(0)