摘要:
和39题不同的地方:1.数组中有重复的数 2.数组中的数只能用一次 阅读全文
摘要:
public static int searchInsert(int[] nums, int target) { int sta = 0,fin = nums.length,mid; while (sta < fin) { mid = (sta + fin )/2; if(nums[mid] < ta... 阅读全文
摘要:
import java.util.ArrayList; import java.util.Arrays; import java.util.List; /** * Given a set of candidate numbers (C) (without duplicates) and a target number (T), * find all unique combinations ... 阅读全文