TestFancy

Author: masx200

fancy-sequence/Fancy_test.go

@@ -0,0 +1,23 @@
+package index
+
+import (
+	"testing"
+
+	"gotest.tools/v3/assert"
+)
+
+func TestFancy(t *testing.T) {
+	var fancy = Constructor()
+	fancy.Append(2)                        // 奇妙序列：[2]
+	fancy.AddAll(3)                        // 奇妙序列：[2+3] -> [5]
+	fancy.Append(7)                        // 奇妙序列：[5, 7]
+	fancy.MultAll(2)                       // 奇妙序列：[5*2, 7*2] -> [10, 14]
+	assert.Equal(t, 10, fancy.GetIndex(0)) // 返回 10
+	fancy.AddAll(3)                        // 奇妙序列：[10+3, 14+3] -> [13, 17]
+	fancy.Append(10)                       // 奇妙序列：[13, 17, 10]
+	fancy.MultAll(2)                       // 奇妙序列：[13*2, 17*2, 10*2] -> [26, 34, 20]
+	assert.Equal(t, 26, fancy.GetIndex(0)) // 返回 26
+	assert.Equal(t, 34, fancy.GetIndex(1)) // 返回 34
+	assert.Equal(t, 20, fancy.GetIndex(2)) // 返回 20
+
+}

go.work

@@ -1,6 +1,7 @@
 go 1.19
 
 use (
+	./fancy-sequence
 	./abbreviating-the-product-of-a-range
 	.
 	./check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence
@@ -18,5 +19,5 @@ use (
 	./transform-to-chessboard
 	./utils
 	./count-complete-tree-nodes
-    ./tree-of-coprimes
+	./tree-of-coprimes
 )

remove-letter-to-equalize-frequency/index.ts

@@ -3,10 +3,8 @@ import { countBy } from "../deps.ts";
 function equalFrequency(word: string): boolean {
     for (let i = 0; i < word.length; i++) {
         const obj = countBy(word.slice(0, i) + word.slice(i + 1)),
-            set = new Set();
-        for (const k in obj) {
-            set.add(obj[k]);
-        }
+            set = new Set<number>(Object.values(obj));
+
         if (set.size === 1) return true;
     }
     return false;