zoukankan      html  css  js  c++  java
  • [LintCode] Letter Combinations of a Phone Number

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

    Cellphone

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

    The order of letter combinations is dicated by the given digit string order. For the given example "23", any of 2's mapping{a, b, c} must appear before any of 3's mapping{d, e, f};

    Thus line 18 picks one letter mapping of a digit, add it to the string buffer, then proceed to repeat the same process on the next digit. The output condition is that we've picked 

    one mapping for each digit. 

    Example

    Given "23"

    Return ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"]

    Related Problems

  • 相关阅读:
    UML画图
    UML笔记
    电脑启动顺序
    评教有感
    部署图
    活动图
    给八期授课之主板电池的思考
    给八期授课之人员分配的思考
    构件图
    cocos2dx获得机器语言
  • 原文地址:https://www.cnblogs.com/lz87/p/7494036.html
Copyright © 2011-2022 走看看