首页 > TAG信息列表 > Possibilities
leetcode 1079 Letter Tile Possibilities
lc1079 Letter Tile Possibilities 利用递归解决 观察题目给出的例子 AAB 按照长度分 A, B AA, AB, BA AAB, ABA, BAA 不难发现，长度为n的解可由长度为n-1的解推出 利用递归，每次长度为n的解可以递归了化简至长度为1 而且为了避免记录组合结果以用来每次比较组合成的结果是否曾经出现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 possible non-empty sequences of letters you can make. Example 1: Input: "AAB" Output: 8 Explanation: The possible sequences are "A"[Swift]LeetCode1079. 活字印刷 | Letter Tile Possibilities
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★➤微信公众号：山青咏芝（shanqingyongzhi）➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）➤GitHub地址：https://github.com/strengthen/LeetCode➤原文地址：https://www.cnblogs.com/strengLeetcode-5087 Letter Tile Possibilities(活字印刷)
1 #define _for(i,a,b) for(int i = (a);i < b;i ++) 2 3 class Solution 4 { 5 public: 6 set<string> s; 7 int numTilePossibilities(string tiles) 8 { 9 s.clear();10 int rnt = 0;11 for (