feat: add typescript solution to lc problem: No.0539 (doocs#673)

No.0539. Minimum Time Difference

Author: YangFong

solution/0500-0599/0539.Minimum Time Difference/README.md

@@ -144,6 +144,27 @@ func min(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function findMinDifference(timePoints: string[]): number {
+    const mins = timePoints
+        .map(item => Number(item.slice(0, 2)) * 60 + Number(item.slice(3, 5)))
+        .sort((a, b) => a - b);
+    const n = mins.length;
+    let res = Infinity;
+    for (let i = 0; i < n - 1; i++) {
+        res = Math.min(res, mins[i + 1] - mins[i]);
+    }
+
+    const first = mins[0] + 24 * 60;
+    const last = mins[n - 1];
+    res = Math.min(res, first - last);
+
+    return res;
+}
+```
+
 ### **...**
 
 ```

solution/0500-0599/0539.Minimum Time Difference/README_EN.md

@@ -122,6 +122,27 @@ func min(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function findMinDifference(timePoints: string[]): number {
+    const mins = timePoints
+        .map(item => Number(item.slice(0, 2)) * 60 + Number(item.slice(3, 5)))
+        .sort((a, b) => a - b);
+    const n = mins.length;
+    let res = Infinity;
+    for (let i = 0; i < n - 1; i++) {
+        res = Math.min(res, mins[i + 1] - mins[i]);
+    }
+
+    const first = mins[0] + 24 * 60;
+    const last = mins[n - 1];
+    res = Math.min(res, first - last);
+
+    return res;
+}
+```
+
 ### **...**
 
 ```

solution/0500-0599/0539.Minimum Time Difference/Solution.ts

@@ -0,0 +1,16 @@
+function findMinDifference(timePoints: string[]): number {
+    const mins = timePoints
+        .map(item => Number(item.slice(0, 2)) * 60 + Number(item.slice(3, 5)))
+        .sort((a, b) => a - b);
+    const n = mins.length;
+    let res = Infinity;
+    for (let i = 0; i < n - 1; i++) {
+        res = Math.min(res, mins[i + 1] - mins[i]);
+    }
+
+    const first = mins[0] + 24 * 60;
+    const last = mins[n - 1];
+    res = Math.min(res, first - last);
+
+    return res;
+}