feat: add solutions to lc problems: No.0026,0027,0080

* No.0026.Remove Duplicates from Sorted Array
* No.0027.Remove Element
* No.0080.Remove Duplicates from Sorted Array II

Author: yanglbme

solution/0000-0099/0026.Remove Duplicates from Sorted Array/README.md

@@ -159,6 +159,20 @@ func removeDuplicates(nums []int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function removeDuplicates(nums: number[]): number {
+    let k: number = 0;
+    for (const x of nums) {
+        if (k === 0 || x !== nums[k - 1]) {
+            nums[k++] = x;
+        }
+    }
+    return k;
+}
+```
+
 ### **JavaScript**
 
 ```js

solution/0000-0099/0026.Remove Duplicates from Sorted Array/README_EN.md

@@ -134,6 +134,20 @@ func removeDuplicates(nums []int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function removeDuplicates(nums: number[]): number {
+    let k: number = 0;
+    for (const x of nums) {
+        if (k === 0 || x !== nums[k - 1]) {
+            nums[k++] = x;
+        }
+    }
+    return k;
+}
+```
+
 ### **JavaScript**
 
 ```js

solution/0000-0099/0026.Remove Duplicates from Sorted Array/Solution.ts

@@ -0,0 +1,9 @@
+function removeDuplicates(nums: number[]): number {
+    let k: number = 0;
+    for (const x of nums) {
+        if (k === 0 || x !== nums[k - 1]) {
+            nums[k++] = x;
+        }
+    }
+    return k;
+}

solution/0000-0099/0027.Remove Element/README.md

@@ -142,6 +142,20 @@ func removeElement(nums []int, val int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function removeElement(nums: number[], val: number): number {
+    let k: number = 0;
+    for (const x of nums) {
+        if (x !== val) {
+            nums[k++] = x;
+        }
+    }
+    return k;
+}
+```
+
 ### **JavaScript**
 
 ```js

solution/0000-0099/0027.Remove Element/README_EN.md

@@ -138,6 +138,20 @@ func removeElement(nums []int, val int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function removeElement(nums: number[], val: number): number {
+    let k: number = 0;
+    for (const x of nums) {
+        if (x !== val) {
+            nums[k++] = x;
+        }
+    }
+    return k;
+}
+```
+
 ### **JavaScript**
 
 ```js

solution/0000-0099/0027.Remove Element/Solution.ts

@@ -0,0 +1,9 @@
+function removeElement(nums: number[], val: number): number {
+    let k: number = 0;
+    for (const x of nums) {
+        if (x !== val) {
+            nums[k++] = x;
+        }
+    }
+    return k;
+}

solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README.md

@@ -149,6 +149,20 @@ func removeDuplicates(nums []int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function removeDuplicates(nums: number[]): number {
+    let k = 0;
+    for (const x of nums) {
+        if (k < 2 || x !== nums[k - 2]) {
+            nums[k++] = x;
+        }
+    }
+    return k;
+}
+```
+
 ### **C#**
 
 ```cs

solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README_EN.md

@@ -123,6 +123,20 @@ func removeDuplicates(nums []int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function removeDuplicates(nums: number[]): number {
+    let k = 0;
+    for (const x of nums) {
+        if (k < 2 || x !== nums[k - 2]) {
+            nums[k++] = x;
+        }
+    }
+    return k;
+}
+```
+
 ### **C#**
 
 ```cs

solution/0000-0099/0080.Remove Duplicates from Sorted Array II/Solution.ts

@@ -0,0 +1,9 @@
+function removeDuplicates(nums: number[]): number {
+    let k = 0;
+    for (const x of nums) {
+        if (k < 2 || x !== nums[k - 2]) {
+            nums[k++] = x;
+        }
+    }
+    return k;
+}