2015年6月30日
Container With Most Water——LeetCode
摘要： Givennnon-negative integersa1,a2, ...,an, where each represents a point at coordinate (i,ai).nvertical lines are drawn such that the two endpoints of ... 阅读全文
posted @ 2015-06-30 14:14 丶Blank 阅读(196) 评论(0) 推荐(0)
Majority Element II——LeetCode
摘要： 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 @ 2015-06-30 00:34 丶Blank 阅读(255) 评论(0) 推荐(0)