2017年10月15日
414. Third Maximum Number
摘要： Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexi 阅读全文
posted @ 2017-10-15 08:58 daniel456 阅读(127) 评论(0) 推荐(0) 编辑
283. Move Zeroes
摘要： Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements. For example, giv 阅读全文
posted @ 2017-10-15 08:50 daniel456 阅读(155) 评论(0) 推荐(0) 编辑
268. Missing Number
摘要： Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array. For example,Given nums = [0, 1, 阅读全文
posted @ 2017-10-15 08:41 daniel456 阅读(130) 评论(0) 推荐(0) 编辑
2017年10月14日
219. Contains Duplicate II
摘要： Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the  阅读全文
posted @ 2017-10-14 21:47 daniel456 阅读(154) 评论(0) 推荐(0) 编辑
217. Contains Duplicate
摘要： Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the arr 阅读全文
posted @ 2017-10-14 21:36 daniel456 阅读(104) 评论(0) 推荐(0) 编辑
189. Rotate Array
摘要： Rotate an array of n elements to the right by k steps. For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4]. Not 阅读全文
posted @ 2017-10-14 21:34 daniel456 阅读(94) 评论(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-10-14 21:24 daniel456 阅读(103) 评论(0) 推荐(0) 编辑
167. Two Sum II - Input array is sorted
摘要： Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number. The function 阅读全文
posted @ 2017-10-14 21:22 daniel456 阅读(126) 评论(0) 推荐(0) 编辑
122. Best Time to Buy and Sell Stock II
摘要： Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may comple 阅读全文
posted @ 2017-10-14 21:16 daniel456 阅读(127) 评论(0) 推荐(0) 编辑
121. Best Time to Buy and Sell Stock
摘要： Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction 阅读全文
posted @ 2017-10-14 21:13 daniel456 阅读(130) 评论(0) 推荐(0) 编辑