17 电话号码的字母组合MAPPING,,abc,def,ghi,jkl,mno,pqrs,tuv,wxyz class Solution: def letterCombinations(self, digits: str) - List[str]: ans[] nlen(digits) path[]*n def dfs(i:int)-None: if in: ans.append(.join(path)) return for a in MAPPING[int(digits[i])]: path[i]a dfs(i1) dfs(0) return ans35 搜索插入位置class Solution: def searchInsert(self, nums: List[int], target: int) - int: left,right-1,len(nums) while left1right: mid(leftright)//2 if nums[mid]target:leftmid else:rightmid return right