2016年1月10日
【数组】Majority Element II
摘要： 题目：Given an integer array of sizen, find all elements that appear more than⌊ n/3 ⌋times. The algorithm should run in linear time and in O(1) space.思路：... 阅读全文
posted @ 2016-01-10 22:42 很好玩 阅读(363) 评论(0) 推荐(0)
【数组】Maximum Product Subarray
摘要： 题目：Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array[2,3,-2,4],... 阅读全文
posted @ 2016-01-10 20:55 很好玩 阅读(199) 评论(0) 推荐(0)