[LeetCode] Letter Combinations of a Phone Number

最新推荐文章于 2020-08-10 10:20:18 发布

weixin_30340617

最新推荐文章于 2020-08-10 10:20:18 发布

阅读量61

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/diegodu/p/4276573.html

本文详细介绍了如何使用深度优先搜索（DFS）或回溯算法将数字字符串转换为对应的字母组合，通过映射电话按键上的字符实现。包括具体代码实现、示例输出及注意事项。

Given a digit string, 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.

Input:Digit string "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.

典型的dfs 或者说backtrace 思路

class Solution {
            map<char, string> m_maps;
            string m_digits;
    public:
       void backtrace(string & inStr, vector<string> & result)
//       void backtrace(string  inStr, vector<string> & result)
        {   
            if(inStr.size() == m_digits.size())
            {   
                result.push_back(inStr);
                return;
            }   
            size_t inSize = inStr.size(); 
            string charMap = m_maps[m_digits[inSize]];

            for(size_t i = 0; i < charMap.size(); i++)
            {   
                inStr += charMap[i];
                backtrace(inStr, result);
                inStr.erase(inStr.end() - 1); 
            }   
        }   

        vector<string> letterCombinations(string digits) {
            vector<string> result;
            string inStr;
                
            m_maps['2'] = "abc";
            m_maps['3'] = "def";
            m_maps['4'] = "ghi";
            m_maps['5'] = "jkl";
            m_maps['6'] = "mno";
            m_maps['7'] = "pqrs";
            m_maps['8'] = "tuv";
            m_maps['9'] = "wxyz";
            m_maps['0'] = " ";

            m_digits = digits;

            backtrace(inStr, result);

            return result;
        }
};