Just DO IT by luckygxf

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

摘要： Clone an undirected graph. Each node in the graph contains alabeland a list of itsneighbors.OJ's undirected graph serialization:Nodes are labeled uniq... 阅读全文

摘要： Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-nega... 阅读全文

摘要： Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array[−2,1,−3,4,−1,2,1,... 阅读全文

摘要： 原出处：http://blog.csdn.net/yuebinghaoyuan/article/details/7244123java中把生成Class对象和实例对象弄混了，更何况生成Class对象和生成instance都有多种方式。所以只有弄清其中的原理，才可以深入理解。首先要生成Class对象，... 阅读全文

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

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

摘要： Implement pow(x,n).可以直接调用api1 public class Solution {2 public double pow(double x, int n) {3 return Math.pow(x, n);4 }5 }这道题其实和Divide ... 阅读全文

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

摘要： The set[1,2,3,…,n]contains a total ofn! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence (ie... 阅读全文