day28-复原IP&子集

复原IP leetcode 93

其实就是分割 回溯的典型

  public static List<String> result= new ArrayList<>();
    public static String oneResult =new String();

    public static List<String> restoreIpAddresses(String s){

        int startIndex=0;
        result = new ArrayList<>();
        backTracking(s,startIndex);
        return result;
    }

    private static void backTracking(String s, int startIndex) {
        if(oneResult.split("\\.").length>=4){
            if(oneResult.length()==s.length()+4) {
                String newString = oneResult.substring(0, oneResult.length() - 1);
                result.add(newString);
            }
            return;
        }

        for(int i=startIndex;i<s.length();i++){
            String tmp = s.substring(startIndex,i+1);
            if(tmp.equals("0") || (!(tmp.substring(0,1).equals("0")) && Integer.valueOf(tmp)>=1 && Integer.valueOf(tmp)<=255)){
                oneResult = oneResult + tmp +".";
            }else {
                break;
            }
            backTracking(s,i+1);
            oneResult = oneResult.substring(0,oneResult.length()-tmp.length()-1);
        }
    }

子集 leetcode90

   public static List<List<Integer>> result = new ArrayList<>();
    public static Deque que = new LinkedList();


    public static List<List<Integer>> subsetsWithDup(int[] nums){
        result = new ArrayList<>();
        int startIndex = 0;
        Arrays.sort(nums);//先排个序
        backTracking(nums,startIndex);
        result.add(new ArrayList<>());
        return  result;
    }

    private static void backTracking(int[] nums, int startIndex) {
        if(startIndex==nums.length){
            return;
        }
        for(int i=startIndex;i<nums.length;i++){
            if(i>startIndex&& nums[i]==nums[i-1]){
                continue;//这里去重 同层要去，同枝不用
            }
            que.offer(nums[i]);
            result.add(new ArrayList<>(que));
            backTracking(nums,i+1);
            que.pollLast();
        }
    }