feat: add ts solution to lc problem: No.0001 (doocs#2012)

* feat: add solutions to lc problem: No.0001

* Update Solution.ts

* style: format code and docs with prettier

* Update README.md

* Update README_EN.md

---------

Co-authored-by: iam-abhishek-yadav <iam-abhishek-yadav@users.noreply.github.com>

Author: iam-abhishek-yadav

solution/0000-0099/0001.Two Sum/README.md

@@ -255,6 +255,25 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function twoSum(nums: number[], target: number): number[] {
+    const m: Map<number, number> = new Map();
+
+    for (let i = 0; ; ++i) {
+        const x = nums[i];
+        const y = target - x;
+
+        if (m.has(y)) {
+            return [m.get(y)!, i];
+        }
+
+        m.set(x, i);
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0001.Two Sum/README_EN.md

@@ -244,6 +244,25 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function twoSum(nums: number[], target: number): number[] {
+    const m: Map<number, number> = new Map();
+
+    for (let i = 0; ; ++i) {
+        const x = nums[i];
+        const y = target - x;
+
+        if (m.has(y)) {
+            return [m.get(y)!, i];
+        }
+
+        m.set(x, i);
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0001.Two Sum/Solution.ts

@@ -0,0 +1,14 @@
+function twoSum(nums: number[], target: number): number[] {
+    const m: Map<number, number> = new Map();
+
+    for (let i = 0; ; ++i) {
+        const x = nums[i];
+        const y = target - x;
+
+        if (m.has(y)) {
+            return [m.get(y)!, i];
+        }
+
+        m.set(x, i);
+    }
+}