LeetCode #17 Letter Combinations of a Phone Number

class Solution:
    # @param {string} digits
    # @return {string[]}
    def letterCombinations(self, digits):
        depth = 0
        ans = []
        path = ""
        self.comb(depth,ans,digits,path)
        return ans
        
    def comb(self,depth,ans,digits,path):
        phoneList = ["","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"]
        
        if len(digits) == 0:
            return
        
        if depth == len(digits):
            ans.append(path)
            return
        
        num = int(digits[depth])
        
        for i in range(0,len(phoneList[num])):
            path+=phoneList[num][i]
            self.comb(depth+1,ans,digits,path)
            path=path[0:-1]