feat: add ts solution to lc problem: No.2406 (doocs#2738)

Author: cblh

solution/2400-2499/2406.Divide Intervals Into Minimum Number of Groups/README.md

@@ -130,6 +130,20 @@ func (h *hp) Pop() any {
 }
 ```
 
+```ts
+function minGroups(intervals: number[][]): number {
+    intervals.sort((a, b) => a[0] - b[0]);
+    const q = new PriorityQueue({ compare: (a, b) => a - b });
+    for (const [l, r] of intervals) {
+        if (!q.isEmpty() && q.front() < l) {
+            q.dequeue();
+        }
+        q.enqueue(r);
+    }
+    return q.size();
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

solution/2400-2499/2406.Divide Intervals Into Minimum Number of Groups/README_EN.md

@@ -127,6 +127,20 @@ func (h *hp) Pop() any {
 }
 ```
 
+```ts
+function minGroups(intervals: number[][]): number {
+    intervals.sort((a, b) => a[0] - b[0]);
+    const q = new PriorityQueue({ compare: (a, b) => a - b });
+    for (const [l, r] of intervals) {
+        if (!q.isEmpty() && q.front() < l) {
+            q.dequeue();
+        }
+        q.enqueue(r);
+    }
+    return q.size();
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

solution/2400-2499/2406.Divide Intervals Into Minimum Number of Groups/Solution.ts

@@ -0,0 +1,11 @@
+function minGroups(intervals: number[][]): number {
+    intervals.sort((a, b) => a[0] - b[0]);
+    const q = new PriorityQueue({ compare: (a, b) => a - b });
+    for (const [l, r] of intervals) {
+        if (!q.isEmpty() && q.front() < l) {
+            q.dequeue();
+        }
+        q.enqueue(r);
+    }
+    return q.size();
+}