【leetcode】17. Letter Combinations of a Phone Number

17. Letter Combinations of a Phone Number

Medium

Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent.

A mapping of digit to letters (just like on the telephone buttons) is given below. Note that 1 does not map to any letters.

Example:

Input: "23"
Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].

Note:

Although the above answer is in lexicographical order, your answer could be in any order you want.

题目链接：https://leetcode.com/problems/letter-combinations-of-a-phone-number/

 

题虽简单，但两种方法对比下。

法一：递归调用digit长度次数，每次生成一个完整的答案加入容器中。

法二：循环digit长度次数，每次生成储存所有不完整答案的容器，不断替换新容器。