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

No.1996.The Number of Weak Characters in the Game

Author: zhaocchen

solution/1900-1999/1996.The Number of Weak Characters in the Game/README.md

@@ -98,6 +98,25 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function numberOfWeakCharacters(properties: number[][]): number {
+    properties.sort((a, b) => (a[0] != b[0]) ? (b[0] - a[0]) : (a[1] - b[1]));
+
+    let ans = 0;
+    let max = 0;
+    for (let [ , b] of properties) {
+        if (b < max) {
+            ans++;
+        } else {
+            max = b;
+        }
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/1900-1999/1996.The Number of Weak Characters in the Game/README_EN.md

@@ -82,6 +82,25 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function numberOfWeakCharacters(properties: number[][]): number {
+    properties.sort((a, b) => (a[0] != b[0]) ? (b[0] - a[0]) : (a[1] - b[1]));
+
+    let ans = 0;
+    let max = 0;
+    for (let [ , b] of properties) {
+        if (b < max) {
+            ans++;
+        } else {
+            max = b;
+        }
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/1900-1999/1996.The Number of Weak Characters in the Game/Solution.ts

@@ -0,0 +1,14 @@
+function numberOfWeakCharacters(properties: number[][]): number {
+    properties.sort((a, b) => (a[0] != b[0]) ? (b[0] - a[0]) : (a[1] - b[1]));
+
+    let ans = 0;
+    let max = 0;
+    for (let [ , b] of properties) {
+        if (b < max) {
+            ans++;
+        } else {
+            max = b;
+        }
+    }
+    return ans;
+};