diff options
author | jack <[email protected]> | 2024-06-14 13:13:15 -0600 |
---|---|---|
committer | jack <[email protected]> | 2024-06-14 13:13:15 -0600 |
commit | d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa (patch) | |
tree | 96df922dae2a5073d9a50ea70c7aae6aa37e3ebe /letter_tile_possibilities.py | |
download | leetcode-d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa.tar.gz leetcode-d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa.zip |
initial
Diffstat (limited to 'letter_tile_possibilities.py')
-rw-r--r-- | letter_tile_possibilities.py | 31 |
1 files changed, 31 insertions, 0 deletions
diff --git a/letter_tile_possibilities.py b/letter_tile_possibilities.py new file mode 100644 index 0000000..3d5e883 --- /dev/null +++ b/letter_tile_possibilities.py @@ -0,0 +1,31 @@ +# 1079. Letter Tile Possibilities + +""" +given 'n' tiles where each tile has one letter ('tiles[i]') printed on it. +return the number of possible non-empty letters printed on those tiles. +""" + + +class Solution(object): + def numTilePossibilities(self, tiles): + """ + :type tiles: str + :rtype: int + """ + ans = set() + + def dfs(path, tiles): + if path: + ans.add(path) + for i in range(len(tiles)): + dfs(path + tiles[i], tiles[:i] + tiles[i + 1 :]) + + dfs("", tiles) + return len(ans) + + +if __name__ == "__main__": + obj = Solution() + print(obj.numTilePossibilities("AAB")) + print(obj.numTilePossibilities("AAABBC")) + print(obj.numTilePossibilities("V")) |