2017年10月15日
532 K-diff Pairs in an Array
摘要： Given an array of integers and an integer k, you need to find the number of unique k-diff pairs in the array. Here a k-diff pair is defined as an inte 阅读全文
posted @ 2017-10-15 09:44 daniel456 阅读(165) 评论(0) 推荐(0)
485. Max Consecutive Ones
摘要： Given a binary array, find the maximum number of consecutive 1s in this array. Example 1: Note: The input array will only contain 0 and 1. The length 阅读全文
posted @ 2017-10-15 09:35 daniel456 阅读(138) 评论(0) 推荐(0)
448. Find All Numbers Disappeared in an Array
摘要： Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once. Find all the elements of [1, n] 阅读全文
posted @ 2017-10-15 09:03 daniel456 阅读(154) 评论(0) 推荐(0)
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 阅读(139) 评论(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 阅读(163) 评论(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 阅读(143) 评论(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 阅读(160) 评论(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 阅读(115) 评论(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 阅读(99) 评论(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 阅读(108) 评论(0) 推荐(0)