Movatterモバイル変換


[0]ホーム

URL:


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

Commit88346eb

Browse files
refactor 1079
1 parente05a377 commit88346eb

File tree

1 file changed

+0
-19
lines changed

1 file changed

+0
-19
lines changed

‎src/main/java/com/fishercoder/solutions/_1079.java

Lines changed: 0 additions & 19 deletions
Original file line numberDiff line numberDiff line change
@@ -5,25 +5,6 @@
55
importjava.util.List;
66
importjava.util.stream.IntStream;
77

8-
/**
9-
* 5087. Letter Tile Possibilities
10-
*
11-
* You have a set of tiles, where each tile has one letter tiles[i] printed on it.
12-
* Return the number of possible non-empty sequences of letters you can make.
13-
*
14-
* Example 1:
15-
* Input: "AAB"
16-
* Output: 8
17-
* Explanation: The possible sequences are "A", "B", "AA", "AB", "BA", "AAB", "ABA", "BAA".
18-
*
19-
* Example 2:
20-
* Input: "AAABBC"
21-
* Output: 188
22-
*
23-
* Note:
24-
* 1. 1 <= tiles.length <= 7
25-
* 2. tiles consists of uppercase English letters.
26-
* */
278
publicclass_1079 {
289
publicstaticclassSolution1 {
2910
publicintnumTilePossibilities(Stringtiles) {

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp