2014年12月20日

摘要: Maximum SubarrayFind the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [... 阅读全文
posted @ 2014-12-20 20:25 Yu's Garden 阅读(3402) 评论(1) 推荐(0) 编辑
摘要: Majority Number II 原题链接: http://lintcode.com/en/problem/majority-number-ii/#Given an array of integers, the majority number is the number that occurs ... 阅读全文
posted @ 2014-12-20 19:42 Yu's Garden 阅读(3171) 评论(1) 推荐(0) 编辑
摘要: Interleaving Positive and Negative Numbers 原题链接 : http://lintcode.com/zh-cn/problem/interleaving-positive-and-negative-numbers/Given an array with pos... 阅读全文
posted @ 2014-12-20 17:00 Yu's Garden 阅读(3534) 评论(0) 推荐(1) 编辑
摘要: Implement Queue by Stacks 原题链接 : http://lintcode.com/zh-cn/problem/implement-queue-by-stacks/#As the title described, you should only use two stacks t... 阅读全文
posted @ 2014-12-20 15:39 Yu's Garden 阅读(1231) 评论(0) 推荐(0) 编辑
摘要: Quick Sorthttp://en.wikipedia.org/wiki/QuicksortQuicksort, orpartition-exchange sort, is asorting algorithmdeveloped byTony Hoarethat,on average, make... 阅读全文
posted @ 2014-12-20 12:43 Yu's Garden 阅读(1481) 评论(0) 推荐(0) 编辑
摘要: Majority Number 原题链接:http://lintcode.com/en/problem/majority-number/#Given an array of integers, the majority number is the number that occurs more th... 阅读全文
posted @ 2014-12-20 07:58 Yu's Garden 阅读(3454) 评论(0) 推荐(0) 编辑

导航