Given a digit string, return all possible letter combinations, the number could represent.
A mapping of Digit to letters (just as on the telephone buttons) is given below.
Input:digit string "Output": ["ad", "AE", "AF", "BD", "Be", "BF", "CD", "CE", "CF"].
1 Public classSolution {2 Public StaticList<string>lettercombinations (String digits) {3String digitletter[] = {"", "", "abc", "Def", "Ghi", "JKL", "MnO", "PQRS", "TUV", "WXYZ"};4list<string> result =NewArraylist<string>();5 6 if(Digits.length () ==0)returnresult;7 8Result.add ("");9 for(inti=0; I<digits.length (); i++) Tenresult = Combine (Digitletter[digits.charat (i)-' 0 '],result); One A returnresult; - } - the Public StaticList<string> Combine (String digit, list<string>list) { -list<string> result =NewArraylist<string>(); - - for(inti=0; I<digit.length (); i++) + for(String x:list) -Result.add (x+Digit.charat (i)); + A returnresult; at } -}
[?*] Letter combinations of a Phone number