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

No.2150.Find All Lonely Numbers in the Array

Author: zhaocchen

Diff for: solution/2100-2199/2150.Find All Lonely Numbers in the Array/README.md

@@ -135,7 +135,19 @@ func findLonely(nums []int) []int {
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```ts
-
+function findLonely(nums: number[]): number[] {
+    let hashMap: Map<number, number> = new Map();
+    for (let num of nums) {
+        hashMap.set(num, (hashMap.get(num) || 0) + 1);
+    }
+    let ans: Array<number> = [];
+    for (let [num, count] of hashMap.entries()) {
+        if (count == 1 && !hashMap.get(num - 1) && !hashMap.get(num + 1)) {
+            ans.push(num);
+        }
+    }
+    return ans;
+};
 ```
 
 ### **...**

Diff for: solution/2100-2199/2150.Find All Lonely Numbers in the Array/README_EN.md

@@ -126,7 +126,19 @@ func findLonely(nums []int) []int {
 ### **TypeScript**
 
 ```ts
-
+function findLonely(nums: number[]): number[] {
+    let hashMap: Map<number, number> = new Map();
+    for (let num of nums) {
+        hashMap.set(num, (hashMap.get(num) || 0) + 1);
+    }
+    let ans: Array<number> = [];
+    for (let [num, count] of hashMap.entries()) {
+        if (count == 1 && !hashMap.get(num - 1) && !hashMap.get(num + 1)) {
+            ans.push(num);
+        }
+    }
+    return ans;
+};
 ```
 
 ### **...**

Diff for: solution/2100-2199/2150.Find All Lonely Numbers in the Array/Solution.ts

@@ -0,0 +1,13 @@
+function findLonely(nums: number[]): number[] {
+    let hashMap: Map<number, number> = new Map();
+    for (let num of nums) {
+        hashMap.set(num, (hashMap.get(num) || 0) + 1);
+    }
+    let ans: Array<number> = [];
+    for (let [num, count] of hashMap.entries()) {
+        if (count == 1 && !hashMap.get(num - 1) && !hashMap.get(num + 1)) {
+            ans.push(num);
+        }
+    }
+    return ans;
+};