碧海恋天的博客

3Sum ClosestGiven 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. You may assume that each in

Combination SumGiven a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number may be c

PermutationsGiven a collection of numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,

AnagramsGiven an array of strings, return all groups of strings that are anagrams.Note: All inputs will be in lower-case.什么是anagrams？/** 整理的提交代码 * 处理复杂度为O(n)，n是字符串个数，但是其中有排序等步骤没有固

Climbing StairsYou are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?/** 整理的

Add Two NumbersYou are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers

4SumGiven an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.No

Add BinaryGiven two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100"./** 整理的提交代码 * 处理复杂度为O(max(n1,n2)) * 主要思路： * 1、先处理特殊情况，有其中一个为空，则

3SumGiven an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:Elements in

Combination Sum IIGiven a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.Each number in C may on