refactor 17

fishercoder1534 · fishercoder1534 · commit c80a9d80dfac · 2020-04-27T06:21:59.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_17.java b/src/main/java/com/fishercoder/solutions/_17.java
@@ -3,19 +3,6 @@
 import java.util.ArrayList;
 import java.util.List;
 
-/**
- * 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 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.
- */
-
 public class _17 {
 
     public static class Solution1 {
