feat: add typescript solution to lc problem: No.2047 (doocs#594)

No.2047.Number of Valid Words in a Sentence

Author: zhaocchen

solution/2000-2099/2047.Number of Valid Words in a Sentence/README.md

@@ -85,6 +85,47 @@
 
 ```
 
+### **TypeScript**
+
+```ts
+function countValidWords(sentence: string): number {
+    let words = sentence.trim().split(/\s+/);
+    let ans = 0;
+    for (let word of words) {
+        if(isValied(word)) {
+            ans++;
+        }
+    }
+    return ans;
+};
+
+function isValied(str: string): boolean {
+    let n = str.length;
+    let hasLine = false;
+    for (let i = 0; i < n; i++) {
+        const char = str.charAt(i);
+        if ((/^[0-9]$/).test(char)) {
+            return false;
+        }
+        if (char == '-') {
+            if (hasLine) return false;
+            else {
+                hasLine = true;
+            }
+            let pre = str.charAt(i - 1),
+            post = str.charAt(i + 1);
+            if (!(/^[a-z]$/g).test(pre) || !(/^[a-z]$/g).test(post)) {
+                return false;
+            }
+        }
+        if ((/^[\!\.\,\s]$/).test(char) && i != n - 1) {
+            return false;
+        }
+    }
+    return true;
+}
+```
+
 ### **...**
 
 ```

solution/2000-2099/2047.Number of Valid Words in a Sentence/README_EN.md

@@ -79,6 +79,47 @@
 
 ```
 
+### **TypeScript**
+
+```ts
+function countValidWords(sentence: string): number {
+    let words = sentence.trim().split(/\s+/);
+    let ans = 0;
+    for (let word of words) {
+        if(isValied(word)) {
+            ans++;
+        }
+    }
+    return ans;
+};
+
+function isValied(str: string): boolean {
+    let n = str.length;
+    let hasLine = false;
+    for (let i = 0; i < n; i++) {
+        const char = str.charAt(i);
+        if ((/^[0-9]$/).test(char)) {
+            return false;
+        }
+        if (char == '-') {
+            if (hasLine) return false;
+            else {
+                hasLine = true;
+            }
+            let pre = str.charAt(i - 1),
+            post = str.charAt(i + 1);
+            if (!(/^[a-z]$/g).test(pre) || !(/^[a-z]$/g).test(post)) {
+                return false;
+            }
+        }
+        if ((/^[\!\.\,\s]$/).test(char) && i != n - 1) {
+            return false;
+        }
+    }
+    return true;
+}
+```
+
 ### **...**
 
 ```

solution/2000-2099/2047.Number of Valid Words in a Sentence/Solution.ts

@@ -0,0 +1,37 @@
+
+function countValidWords(sentence: string): number {
+    let words = sentence.trim().split(/\s+/);
+    let ans = 0;
+    for (let word of words) {
+        if(isValied(word)) {
+            ans++;
+        }
+    }
+    return ans;
+};
+
+function isValied(str: string): boolean {
+    let n = str.length;
+    let hasLine = false;
+    for (let i = 0; i < n; i++) {
+        const char = str.charAt(i);
+        if ((/^[0-9]$/).test(char)) {
+            return false;
+        }
+        if (char == '-') {
+            if (hasLine) return false;
+            else {
+                hasLine = true;
+            }
+            let pre = str.charAt(i - 1),
+            post = str.charAt(i + 1);
+            if (!(/^[a-z]$/g).test(pre) || !(/^[a-z]$/g).test(post)) {
+                return false;
+            }
+        }
+        if ((/^[\!\.\,\s]$/).test(char) && i != n - 1) {
+            return false;
+        }
+    }
+    return true;
+}