leetcode-17：Letter Combinations of a Phone Number電話號碼的字母組合

阿新 • • 發佈：2018-12-22

題目：

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"].

給定一個僅包含數字 2-9 的字串，返回所有它能表示的字母組合。

給出數字到字母的對映如下（與電話按鍵相同）。注意 1 不對應任何字母。

示例:

輸入："23"
輸出：["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].

思路：先建立一個對映表dict。在遍歷數字時，在dict中取出數字對應的字元str。建立一個臨時字元陣列t，將str的每個字元都連線到 res的每個元素的後面。

class Solution {
public:
    vector<string> letterCombinations(string digits) {
        if(digits.empty()) return {};
        vector<string> res{""};
        string dict[]={"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
        for(int i=0;i<digits.size();++i)
        {
            string str=dict[digits[i]-'0'];
            vector<string> t;
            for(int j=0;j<str.size();j++)
                for(string s:res) t.push_back(s+str[j]);
            res = t;
        }return res;
    }
};

參考：http://www.cnblogs.com/grandyang/p/4452220.html

leetcode-17：Letter Combinations of a Phone Number電話號碼的字母組合

題目： Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could repres

LeetCode 17.Letter Combinations of a Phone Number (電話號碼的字母組合)

題目描述：給定一個僅包含數字 2-9 的字串，返回所有它能表示的字母組合。給出數字到字母的對映如下（與電話按鍵相同）。注意 1 不對應任何字母。示例：輸入："23" 輸出：["ad", "ae", "af", "bd", "be", "bf", "cd

LeetCode(17) － Letter Combinations of a Phone Number

經典的backtracking（回溯演算法）的題目。當一個題目，存在各種滿足條件的組合，並且需要把它們全部列出來時，就可以考慮backtracking了。當然，backtracking在一定程度上屬於窮舉，所以當資料特別大的時候，不合適。而對於那些題目，可能就需要通過動態規劃來完成。遞

LeetCode 17 — Letter Combinations of a Phone Number(電話號碼的字母組合)

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

[LeetCode] Letter Combinations of a Phone Number 電話號碼的字母組合

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

LeetCode（17）Letter Combinations of a Phone Number

app code com elf img bject dex logs nbsp 題目如下： Python代碼： class Solution(object): def letterCombinations(self, digits): """

【Leetcode】17、Letter Combinations of a Phone Number

question pos dia ppi stage ble you xpl class 題目 Given a string containing digits from 2-9 inclusive, return all possible letter combinat

【leetcode】17.(Medium) Letter Combinations of a Phone Number

題目連結解題思路：回溯提交程式碼： class Solution { public List<String> letterCombinations(String digits) { List<String> res=new

【LeetCode & 劍指offer刷題】回溯法與暴力列舉法題5：Letter Combinations of a Phone Number

【LeetCode & 劍指offer 刷題筆記】目錄（持續更新中...） Letter Combinations of a Phone Number Given a string containing digits from

leetcode第17題——**Letter Combinations of a Phone Number

題目 Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just li

leetCode 17.Letter Combinations of a Phone Number(電話數字對應的字母組合) 解題思路和方法

Letter Combinations of a Phone Number Given a digit string, return all possible letter combinations that the number could represent. A m

LeetCode：17. Letter Combinations of a Phone Number（Medium）

class stat def es2017 不同的進行先進先出 ati tps 1. 原題鏈接 https://leetcode.com/problems/letter-combinations-of-a-phone-number/description/ 2. 題目要

Leetcode 17. Letter Combinations of a Phone number

res bsp self. col join lee num nat leetcode 求給出的數字串，如果按照電話鍵盤的編譯方式，可以給出多少那些對應的數字組合。例如： Input:Digit string "23" Output: ["ad", "ae", "af"

[leetcode]17. Letter Combinations of a Phone Number手機鍵盤的字母組合

poi clu char evel 個數字 The let alt input Given a string containing digits from 2-9 inclusive, return all possible letter combinations that

leetcode 17-Letter Combinations of a Phone Number(medium)

shm put note 下標維護 nta style == emp Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the

leetcode#17. Letter Combinations of a Phone Number

commons 註意構建 media ber str http wiki pan 給定一個僅包含數字 2-9 的字符串，返回所有它能表示的字母組合。給出數字到字母的映射如下（與電話按鍵相同）。註意 1 不對應任何字母。示例: 輸入："23" 輸出：["ad", "

LeetCode(17)-Letter Combinations of a Phone Number

17.Letter Combinations of a Phone Number Given a string containing digits from 2-9 inclusive, return all possible letter combinations that

Leetcode -17. Letter Combinations of a Phone Number

這個問題我最開始的想的是使用樹的結構去做，之後用python實現的時候是使用了幾個for迴圈： class Solution: def letterCombinations(self, digits): """ :type digits: str

LeetCode 17. 電話號碼的字母組合 Letter Combinations of a Phone Number

8-1 樹形問題 Letter Combinations of a Phone Number 題目: LeetCode 17. 電話號碼的字母組合給定一個僅包含數字 2-9 的字串，返回所有它能表示的字母組合。給出數字到字母的對映如下（與電話按鍵相同）。注意 1 不對應任

[LeetCode]17. 電話號碼的字母組合（Letter Combinations of a Phone Number）

一、題目： LeetCode地址給定一個僅包含數字 2-9 的字串，返回所有它能表示的字母組合。給出數字到字母的對映如下（與電話按鍵相同）。注意 1 不對應任何字母。示例: 輸入："23" 輸出：["ad", "ae", "af", "bd", "be", "

leetcode-17：Letter Combinations of a Phone Number電話號碼的字母組合

相關推薦