Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 6dfa5b1

Browse files
Solved 17
1 parent 54adbdc commit 6dfa5b1

File tree

1 file changed

+0
-6
lines changed

1 file changed

+0
-6
lines changed

‎src/leetcode/editor/en/[0017] Letter Combinations of a Phone Number.java‎

Lines changed: 0 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -37,10 +37,4 @@ void addRecursively(List<String> out, String s, String digits){
3737
}
3838
//leetcode submit region end(Prohibit modification and deletion)
3939

40-
public static void main(String[] args) {
41-
System.out.println(
42-
new LetterCombinationsOfAPhoneNumber().new Solution().letterCombinations("23")
43-
);
44-
}
45-
4640
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /