forked from paopao2/leetcode-js
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Letter Combinations of a Phone Number.js
58 lines (48 loc) · 1.43 KB
/
Letter Combinations of a Phone Number.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
/**
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.
*/
/**
* @param {string} digits
* @return {string[]}
*/
var letterCombinations = function(digits) {
var len = digits.length,
result = [],
map = {
'1': [''],
'2': ['a', 'b', 'c'],
'3': ['d', 'e', 'f'],
'4': ['g', 'h', 'i'],
'5': ['j', 'k', 'l'],
'6': ['m', 'n', 'o'],
'7': ['p', 'q', 'r', 's'],
'8': ['t', 'u', 'v'],
'9': ['w', 'x', 'y', 'z']
};
if (len === 0) {
return result;
}
return genStrings([''], 0, len, digits, map);
};
function genStrings(curArr, index, len, digits, map) {
var length = curArr.length,
next = [],
temp,
i,
j;
if (index === len) {
return curArr;
}
for (i = 0; i < length; i++) {
for (j = 0; j < map[digits.charAt(index)].length; j++) {
temp = curArr[i] + map[digits.charAt(index)][j];
next.push(temp);
}
}
return genStrings(next, index + 1, len, digits, map);
}