Commit 1201412

committed

Solved 17

1 parent ea4fc42 commit 1201412Copy full SHA for 1201412

File tree

+46

-0

lines changed

+46

-0

lines changed

Lines changed: 46 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,46 @@`
	`1`	`+package leetcode.editor.en;`
	`2`	`+`
	`3`	`+import java.util.*;`
	`4`	`+`
	`5`	`+class LetterCombinationsOfAPhoneNumber {`
	`6`	`+`
	`7`	`+//leetcode submit region begin(Prohibit modification and deletion)`
	`8`	`+class Solution {`
	`9`	`+ public List<String> letterCombinations(String digits) {`
	`10`	`+ if("".equals(digits)) return List.of();`
	`11`	`+ List<String> out = new ArrayList<>();`
	`12`	`+ addRecursively(out, "", digits);`
	`13`	`+ return out;`
	`14`	`+ }`
	`15`	`+ void addRecursively(List<String> out, String s, String digits){`
	`16`	`+ if("".equals(digits)){`
	`17`	`+ out.add(s);`
	`18`	`+ return;`
	`19`	`+ }`
	`20`	`+ char first = digits.charAt(0);`
	`21`	`+ String remaining = digits.substring(1);`
	`22`	`+ for(char c : mappings[first - '2']){`
	`23`	`+ addRecursively(out, s + c, remaining);`
	`24`	`+ }`
	`25`	`+ }`
	`26`	`+`
	`27`	`+ char[][] mappings = new char[][]{`
	`28`	`+ {'a', 'b', 'c'},`
	`29`	`+ {'d', 'e', 'f'},`
	`30`	`+ {'g', 'h', 'i'},`
	`31`	`+ {'j', 'k', 'l'},`
	`32`	`+ {'m', 'n', 'o'},`
	`33`	`+ {'p', 'q', 'r', 's'},`
	`34`	`+ {'t', 'u', 'v'},`
	`35`	`+ {'w', 'x', 'y', 'z'},`
	`36`	`+ };`
	`37`	`+}`
	`38`	`+//leetcode submit region end(Prohibit modification and deletion)`
	`39`	`+`
	`40`	`+ public static void main(String[] args) {`
	`41`	`+ System.out.println(`
	`42`	`+ new LetterCombinationsOfAPhoneNumber().new Solution().letterCombinations("23")`
	`43`	`+ );`
	`44`	`+ }`
	`45`	`+`
	`46`	`+}`

Comments

(0)