算法随想录算法训练营第二十四天|93.复原IP地址 ● 78.子集 ● 90.子集II

九百九十九号

已于 2023-08-31 14:21:45 修改

阅读量34

点赞数

文章标签：算法 windows

于 2023-08-30 21:08:22 首次发布

本文链接：https://blog.csdn.net/weixin_57063930/article/details/132584382

版权

93.复原IP地址

class Solution {
    List<String> lists = new ArrayList<>();
    public List<String> restoreIpAddresses(String s) {
        List<String> list = new ArrayList<>();
        trackTracking(s,0,list);
        return lists;
    }

    public void trackTracking(String s,int start,List<String> list){
        if(list.size() == 4 && start == s.length()){
            StringBuilder sb = new StringBuilder();
            for(int i = 0;i<list.size();i++){
                sb.append(list.get(i));
                if(i!=(list.size()-1))
                    sb.append(".");
            }
            lists.add(sb.toString());
            return ;
        }else if((list.size() == 4 && start != s.length())||(list.size() != 4 && start == s.length())){
            return;
        }
        for(int i = start;i<s.length();i++){
            if(!panduan(s.substring(start,i+1)))
                continue;
            list.add(s.substring(start,i+1));
            trackTracking(s,i+1,list);
            list.remove(list.size()-1);
        }
    }

    public boolean panduan(String s){
        if(s.length()!=1){
            if(s.charAt(0) == '0'){
                return false;
            }
        }
        if(s.length() > 3){
            return false;
        }
        int a = Integer.parseInt(s);
        if(a>255)
            return false;
        else
            return true;
    }
}

78.子集

class Solution {
    List<List<Integer>> lists = new ArrayList<>();
    public List<List<Integer>> subsets(int[] nums) {
        if(nums.length == 0)
            return lists;
        Arrays.sort(nums);
        List<Integer> list = new ArrayList<>();
        backTracking(0,nums,list);
        return lists;
    }

    public void backTracking(int start,int[] nums,List<Integer> list){
        if(start <= nums.length){
            lists.add(new ArrayList(list));
        }
        for(int i = start;i<nums.length;i++){
            if(i == start && i!=0 && nums[i] == nums[i-1])
                continue;
            list.add(nums[i]);
            backTracking(i+1,nums,list);
            list.remove(list.size()-1);
        }
    }
}

90.子集II

class Solution {
    List<List<Integer>> lists = new ArrayList<>();
    public List<List<Integer>> subsetsWithDup(int[] nums) {
        List<Integer> list = new ArrayList<>();
        Arrays.sort(nums);
        backTracking(nums,list,0);
        return lists;
    }

    public void backTracking(int[] nums,List<Integer> list,int start){
        if(start <= nums.length){
            lists.add(new ArrayList<>(list));
        }
        for(int i = start;i<nums.length;i++){
            if(i!=0 && i!=start && nums[i] == nums[i-1]){
                continue;
            }
            list.add(nums[i]);
            backTracking(nums,list,i+1);
            list.remove(list.size()-1);
        }
    }
}