~每天进步一点点~

2015年7月11日

摘要： Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2]have the following unique perm... 阅读全文

posted @ 2015-07-11 11:54 ~每天进步一点点~ 阅读(211) 评论(0) 推荐(0) 编辑

[leedcode 46] Permutations

摘要： Given 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,... 阅读全文

posted @ 2015-07-11 11:03 ~每天进步一点点~ 阅读(132) 评论(0) 推荐(0) 编辑

[leedcode 45] Jump Game II

摘要： Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximu... 阅读全文

posted @ 2015-07-11 09:32 ~每天进步一点点~ 阅读(107) 评论(0) 推荐(0) 编辑

2015年7月10日

[leedcode 43] Multiply Strings

摘要： Straight forward idea. Just like the way we multiply numbers. Don't forget considering the carry and be careful. e.g. 123*456,what we usually do is: ... 阅读全文

posted @ 2015-07-10 22:18 ~每天进步一点点~ 阅读(143) 评论(0) 推荐(0) 编辑

[leedcode 42] Trapping Rain Water

摘要： Givennnon-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.Fo... 阅读全文

posted @ 2015-07-10 18:20 ~每天进步一点点~ 阅读(198) 评论(0) 推荐(0) 编辑

[leedcode 41] First Missing Positive

摘要： Given an unsorted integer array, find the first missing positive integer.For example,Given[1,2,0]return3,and[3,4,-1,1]return2.Your algorithm should ru... 阅读全文

posted @ 2015-07-10 17:17 ~每天进步一点点~ 阅读(177) 评论(0) 推荐(0) 编辑

[leedcode 40] Combination Sum II

摘要： Given a collection of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT.Each number ... 阅读全文

posted @ 2015-07-10 15:59 ~每天进步一点点~ 阅读(157) 评论(0) 推荐(0) 编辑

全排列

摘要： public class Quanpailie { /** * 全排列的思想，第一位和后面的每一位进行交换，然后递归下一位 * combinate(int a[],int start,int end) * 参数的意思是从第start位开始到end位进行全排列 *... 阅读全文

posted @ 2015-07-10 15:33 ~每天进步一点点~ 阅读(189) 评论(0) 推荐(0) 编辑

[leedcode 39] Combination Sum

摘要： Given a set of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT.Thesamerepeated num... 阅读全文

posted @ 2015-07-10 15:27 ~每天进步一点点~ 阅读(197) 评论(0) 推荐(0) 编辑

[leedcode 38] Count and Say

摘要： The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1is read off as"one 1"or11.11is read off as"tw... 阅读全文

posted @ 2015-07-10 14:15 ~每天进步一点点~ 阅读(116) 评论(0) 推荐(0) 编辑

公告