17 2 月, 2025

Last Updated on 2025-02-17 by Clay

題目

You have n  tiles, where each tile has one letter tiles[i] printed on it.

Return the number of possible non-empty sequences of letters you can make using the letters printed on those tiles.