第七章 回溯算法part02(● 216.组合总和III ● 17.电话号码的字母组合)

学习目标：

● 216.组合总和III
● 17.电话号码的字母组合

---

学习内容：● 216.组合总和III

题目链接/文章讲解：https://programmercarl.com/0216.%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8CIII.html
视频讲解：https://www.bilibili.com/video/BV1wg411873x

套用模板

var combinationSum3 = function(k, n) {
    let result = [];
    let path = [];
    const backtracking = function(targetSum,k,startIndex,sum){
        if(sum>targetSum){
            return
        }
        if(path.length==k){
            if(sum == targetSum){
            result.push([...path])
            return
        }
        }
        
        for(let i=startIndex;i<=9-(k-path.length)+1;i++){
            sum+=i;
            path.push(i)
            backtracking(targetSum,k,i+1,sum)
            sum-=i;
            path.pop()
        }
    }
    backtracking(n,k,1,0)
    return result
};

---

学习内容：● 17.电话号码的字母组合

题目链接/文章讲解：https://programmercarl.com/0017.%E7%94%B5%E8%AF%9D%E5%8F%B7%E7%A0%81%E7%9A%84%E5%AD%97%E6%AF%8D%E7%BB%84%E5%90%88.html
视频讲解：https://www.bilibili.com/video/BV1yV4y1V7Ug

var letterCombinations = function(digits) {
   const k = digits.length
   const map = ['','',"abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"]
   if(!k) return []
   if(k==1){
       return map[digits].split("")  
    }
    const result = []
    const path = []
    backtracking(digits,0)
    return result
    function backtracking(digits,index){
        if(path.length==k){
            result.push(path.join(''))
            return
        }
        let s = digits[index]
        let arr = map[s].split("")
        for(let i=0;i<arr.length;i++){
            path.push(arr[i])
            backtracking(digits,index+1)
            path.pop()
        }
    }
};

---