摘要:
public class Solution { public boolean containsDuplicate(int[] nums) { HashSet hs = new HashSet(); for (int i : nums) { ...
阅读全文
posted @ 2015-05-30 08:16
kikiUr
阅读(112)
推荐(0)
编辑
摘要:
public List> combinationSum3(int k, int n) { List> res = new ArrayList>(); List item = new ArrayList(); int sum[] = {0}; ...
阅读全文
posted @ 2015-05-30 08:15
kikiUr
阅读(112)
推荐(0)
编辑
摘要:
public class Solution { public int minSubArrayLen(int s, int[] nums) { if (nums == null || nums.length == 0) { return 0; }...
阅读全文
posted @ 2015-05-30 08:13
kikiUr
阅读(130)
推荐(0)
编辑