feat: 1079

Author: plh97

algorithm/1079.LetterTilePossibilities/README.md

@@ -0,0 +1,27 @@
+# [1079. Letter Tile Possibilities](https://leetcode.com/problems/letter-tile-possibilities/)
+
+## 2019/08/31
+
+### 题目 💗[medium]
+
+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:
+
+```bash
+Input: "AAB"
+Output: 8
+Explanation: The possible sequences are "A", "B", "AA", "AB", "BA", "AAB", "ABA", "BAA".
+```
+
+Example 2:
+
+```bash
+Input: "AAABBC"
+Output: 188
+```
+
+Note:
+
+- 1 <= tiles.length <= 7
+- tiles consists of uppercase English letters.

algorithm/1079.LetterTilePossibilities/main.go

@@ -0,0 +1,29 @@
+package numTilePossibilities
+
+func numTilePossibilities(tiles string) int {
+	res := []string{""}
+
+	for _, tile := range tiles {
+		for _, ee := range res {
+			for i := 0; i <= len(ee); i++ {
+				temp := ee[:i] + string(tile) + ee[i:]
+				res = append(res, temp)
+			}
+		}
+	}
+	Map := make(map[string]bool, len(res))
+	for _, e := range res {
+		Map[string(e)] = true
+	}
+	return len(Map) - 1
+}
+
+// func subsets(nums []int) [][]int {
+// 	res := [][]int{[]int{}}
+// 	for _, e := range nums {
+// 		for _, ee := range res {
+// 			res = append(res, append([]int{e}, ee...))
+// 		}
+// 	}
+// 	return res
+// }

algorithm/1079.LetterTilePossibilities/main_test.go

@@ -0,0 +1,24 @@
+package numTilePossibilities
+
+import (
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+var tcs = []struct {
+	N1  string
+	ans int
+}{
+	{
+		"AAB",
+		8,
+	},
+}
+
+func Test_bitwiseComplement(t *testing.T) {
+	ast := assert.New(t)
+	for _, tc := range tcs {
+		ast.Equal(tc.ans, numTilePossibilities(tc.N1), "输入:%v", tc)
+	}
+}