feat: add typescript solution to lc problem: No.2063.Vowels of All Su…

solution/2000-2099/2063.Vowels of All Substrings/README.md

@@ -66,6 +66,8 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+判断word[i]是否为元音，且在所有子字符串中一共出现了 (i+1)*(n-i) 次
+
 <!-- tabs:start -->
 
 ### **Python3**
@@ -84,6 +86,22 @@
 
 ```
 
+### **TypeScript**
+
+```ts
+function countVowels(word: string): number {
+    const n = word.length;
+    let ans = 0;
+    for (let i = 0; i < n; i++) {
+        let char = word.charAt(i);
+        if (['a', 'e', 'i', 'o', 'u'].includes(char)) {
+            ans += ((i + 1) * (n - i));
+        }
+    }
+    return ans;
+};
+```
+
 ### **...**
 
 ```

solution/2000-2099/2063.Vowels of All Substrings/README_EN.md

@@ -69,6 +69,22 @@ Hence, the total sum of vowels = 1 + 1 + 1 + 0 + 0 + 0 = 3. </pre>
 
 ```
 
+### **TypeScript**
+
+```ts
+function countVowels(word: string): number {
+    const n = word.length;
+    let ans = 0;
+    for (let i = 0; i < n; i++) {
+        let char = word.charAt(i);
+        if (['a', 'e', 'i', 'o', 'u'].includes(char)) {
+            ans += ((i + 1) * (n - i));
+        }
+    }
+    return ans;
+};
+```
+
 ### **Java**
 
 ```java

solution/2000-2099/2063.Vowels of All Substrings/Solution.ts

@@ -0,0 +1,11 @@
+function countVowels(word: string): number {
+    const n = word.length;
+    let ans = 0;
+    for (let i = 0; i < n; i++) {
+        let char = word.charAt(i);
+        if (['a', 'e', 'i', 'o', 'u'].includes(char)) {
+            ans += ((i + 1) * (n - i));
+        }
+    }
+    return ans;
+};