摘要：
Single Number Given 2*n + 1 numbers, every numbers occurs twice except one, find it. Example Given [1,2,2,1,3,4,3], return 4 分析： 利用bit operator ^ 的特点即 阅读全文
posted @ 2016-07-04 11:27
北叶青藤
阅读(165)
评论(0)
推荐(0)
摘要：
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. 阅读全文
posted @ 2016-07-04 10:30
北叶青藤
阅读(217)
评论(0)
推荐(0)
摘要：
3 Sum Given an array S of n integers, are there elements a, b, c in Ssuch that a + b + c = 0? Find all unique triplets in the array which gives the su 阅读全文
posted @ 2016-07-04 07:24
北叶青藤
阅读(239)
评论(0)
推荐(0)
摘要：
Two Sum I Given an array of integers, find two numbers such that they add up to a specific target number. The function twoSum should return indices of 阅读全文
posted @ 2016-07-04 07:13
北叶青藤
阅读(327)
评论(0)
推荐(0)
摘要：
Given a collection of distinct numbers, return all possible permutations. For example,[1,2,3] have the following permutations: [ [1,2,3], [1,3,2], [2, 阅读全文
posted @ 2016-07-04 05:29
北叶青藤
阅读(243)
评论(0)
推荐(0)
摘要：
For a given sorted array (ascending order) and a target number, find the first index of this number in O(log n) time complexity. If the target number 阅读全文
posted @ 2016-07-04 01:22
北叶青藤
阅读(245)
评论(0)
推荐(0)
浙公网安备 33010602011771号