feat: add ts solution to lc problem: No.0849 (doocs#1483)

Author: thinkasany

solution/0800-0899/0849.Maximize Distance to Closest Person/README.md

@@ -167,6 +167,29 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maxDistToClosest(seats: number[]): number {
+    let first = -1,
+        last = -1;
+    let d = 0,
+        n = seats.length;
+    for (let i = 0; i < n; ++i) {
+        if (seats[i] === 1) {
+            if (last !== -1) {
+                d = Math.max(d, i - last);
+            }
+            if (first === -1) {
+                first = i;
+            }
+            last = i;
+        }
+    }
+    return Math.max(Math.floor(d / 2), Math.max(first, n - last - 1));
+}
+```
+
 ### **...**
 
 ```

solution/0800-0899/0849.Maximize Distance to Closest Person/README_EN.md

@@ -147,6 +147,29 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maxDistToClosest(seats: number[]): number {
+    let first = -1,
+        last = -1;
+    let d = 0,
+        n = seats.length;
+    for (let i = 0; i < n; ++i) {
+        if (seats[i] === 1) {
+            if (last !== -1) {
+                d = Math.max(d, i - last);
+            }
+            if (first === -1) {
+                first = i;
+            }
+            last = i;
+        }
+    }
+    return Math.max(Math.floor(d / 2), Math.max(first, n - last - 1));
+}
+```
+
 ### **...**
 
 ```

solution/0800-0899/0849.Maximize Distance to Closest Person/Solution.ts

@@ -0,0 +1,18 @@
+function maxDistToClosest(seats: number[]): number {
+    let first = -1,
+        last = -1;
+    let d = 0,
+        n = seats.length;
+    for (let i = 0; i < n; ++i) {
+        if (seats[i] === 1) {
+            if (last !== -1) {
+                d = Math.max(d, i - last);
+            }
+            if (first === -1) {
+                first = i;
+            }
+            last = i;
+        }
+    }
+    return Math.max(Math.floor(d / 2), Math.max(first, n - last - 1));
+}