2017年6月8日
228. Summary Ranges
摘要： Given a sorted integer array without duplicates, return the summary of its ranges. For example, given [0,1,2,4,5,7], return ["0->2","4->5","7"]. 这个题目不 阅读全文
posted @ 2017-06-08 21:58 NaiveCoder 阅读(91) 评论(0) 推荐(0)
238. Product of Array Except Self
摘要： Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except  阅读全文
posted @ 2017-06-08 20:51 NaiveCoder 阅读(110) 评论(0) 推荐(0)
11. Container With Most Water
摘要： Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpo 阅读全文
posted @ 2017-06-08 20:16 NaiveCoder 阅读(129) 评论(0) 推荐(0)
229. Majority Element II
摘要： Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. The algorithm should run in linear time and in O(1) space. 第一 阅读全文
posted @ 2017-06-08 16:45 NaiveCoder 阅读(130) 评论(0) 推荐(0)
169. Majority Element
摘要： Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the 阅读全文
posted @ 2017-06-08 15:53 NaiveCoder 阅读(93) 评论(0) 推荐(0)