【LeeCode】 Letter Tile Possibilities

5087. Letter Tile Possibilities

You have a set of tiles, where each tile has one letter tiles[i[] printed on it. Return the number of possibile non-empty sequences of letters you can make.

Method 1:  Backtrack Algorithm

class Solution {
    int result = 0;
    public int numTilePossibilities(String tiles) {
        int[] count = new int[26];
        for(char c:tiles.toCharArray()){
            count[c - 'A'] += 1;
        }
        for(int i=1;i<=count.length;i++)
            backtrack(count, i);
        return result;
    }
    public void backtrak(int[] count, int num){
        if(num == 0){
            result++;
            return;
        }
        for(int i=0;i<count.length;i++){
            if(count[i]>0){
                count[i]--;
                help(count, num-1);
                count[i]++;
            }
        }
    }
}