DAY22

最新推荐文章于 2024-10-18 16:37:05 发布

wei375

最新推荐文章于 2024-10-18 16:37:05 发布

阅读量84

点赞数 2

文章标签： windows

本文链接：https://blog.csdn.net/wei375/article/details/141002531

版权

组合

    List<List<Integer>> res;
    LinkedList<Integer> path;
    public List<List<Integer>> combine(int n, int k) {
        res=new ArrayList<List<Integer>>();
        path=new LinkedList<Integer>();
        buildCombine(n,k,1);
        return res;


    }
    public void buildCombine(int n,int k,int index){
        if(path.size()==k){
            res.add(new ArrayList<>(path));
            return;
        }
        for(int i=index;i<=n-(k-path.size())+1;i++){
            path.add(i);
            buildCombine(n,k,i+1);
            path.removeLast();
        }

    }

组合总和 III

    List<List<Integer>> res;
    LinkedList<Integer> path;
    public List<List<Integer>> combinationSum3(int k, int n) {
        res=new ArrayList<List<Integer>>();
        path=new LinkedList<Integer>();
        buildCombination(k,n,0,1);
        return res;
        


    }
    public void buildCombination(int k,int n,int sum,int index){
        if(sum>n)return;
        if(path.size()==k){
            if(n==sum)res.add(new ArrayList<>(path));
            return;
        }
        for(int i=index;i<=9-(k-path.size())+1;i++){
            sum+=i;
            path.add(i);
            buildCombination(k,n,sum,i+1);
            sum-=i;
            path.removeLast();
        }
    }

电话号码的字母组合

    List<String> res=new ArrayList<String>();
    public List<String> letterCombinations(String digits) {
        if(digits==null||digits.length()==0)return res;
        String[] numString={"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
        buildCombination(digits,numString,0);
        return res;


    }
    StringBuilder tmp= new StringBuilder();
    public void buildCombination(String digits,String[] numString,int index){
        if(index==digits.length()){
            res.add(tmp.toString());
            return;
        }
        char c=digits.charAt(index);
        String str=numString[c-'0'];
        for(int i=0;i<str.length();i++){
            tmp.append(str.charAt(i));
            buildCombination(digits,numString,index+1);
            tmp.deleteCharAt(tmp.length()-1);
        }

    }