feat: add typescript solution to lc problem: No.2262

No.2262.Total Appeal of A String

Author: zhaocchen

solution/2200-2299/2262.Total Appeal of A String/README.md

@@ -148,7 +148,17 @@ func appealSum(s string) int64 {
 ### **TypeScript**
 
 ```ts
-
+function appealSum(s: string): number {
+    const n = s.length;
+    let dp = new Array(n + 1).fill(0);
+    const hashMap = new Map();
+    for (let i = 0; i < n; i++) {
+        const c = s.charAt(i);
+        dp[i + 1] = dp[i] + i + 1 - (hashMap.get(c) || 0);
+        hashMap.set(c, i + 1);
+    }
+    return dp.reduce((a, c) => a + c, 0);
+};
 ```
 
 ### **...**

solution/2200-2299/2262.Total Appeal of A String/README_EN.md

@@ -131,7 +131,17 @@ func appealSum(s string) int64 {
 ### **TypeScript**
 
 ```ts
-
+function appealSum(s: string): number {
+    const n = s.length;
+    let dp = new Array(n + 1).fill(0);
+    const hashMap = new Map();
+    for (let i = 0; i < n; i++) {
+        const c = s.charAt(i);
+        dp[i + 1] = dp[i] + i + 1 - (hashMap.get(c) || 0);
+        hashMap.set(c, i + 1);
+    }
+    return dp.reduce((a, c) => a + c, 0);
+};
 ```
 
 ### **...**

solution/2200-2299/2262.Total Appeal of A String/Solution.ts

@@ -0,0 +1,11 @@
+function appealSum(s: string): number {
+    const n = s.length;
+    let dp = new Array(n + 1).fill(0);
+    const hashMap = new Map();
+    for (let i = 0; i < n; i++) {
+        const c = s.charAt(i);
+        dp[i + 1] = dp[i] + i + 1 - (hashMap.get(c) || 0);
+        hashMap.set(c, i + 1);
+    }
+    return dp.reduce((a, c) => a + c, 0);
+};