fix: update ts solution to lc problem: No.1631 (#4928)

Author: yanglbme

solution/1600-1699/1631.Path With Minimum Effort/README.md

@@ -818,7 +818,7 @@ func (h *hp) Pop() any          { a := *h; v := a[len(a)-1]; *h = a[:len(a)-1];
 function minimumEffortPath(heights: number[][]): number {
     const m = heights.length;
     const n = heights[0].length;
-    const pq = new PriorityQueue({ compare: (a, b) => a[0] - b[0] });
+    const pq = new PriorityQueue<number[]>((a, b) => a[0] - b[0]);
     pq.enqueue([0, 0, 0]);
     const dist = Array.from({ length: m }, () => Array.from({ length: n }, () => Infinity));
     dist[0][0] = 0;

solution/1600-1699/1631.Path With Minimum Effort/README_EN.md

@@ -816,7 +816,7 @@ func (h *hp) Pop() any          { a := *h; v := a[len(a)-1]; *h = a[:len(a)-1];
 function minimumEffortPath(heights: number[][]): number {
     const m = heights.length;
     const n = heights[0].length;
-    const pq = new PriorityQueue({ compare: (a, b) => a[0] - b[0] });
+    const pq = new PriorityQueue<number[]>((a, b) => a[0] - b[0]);
     pq.enqueue([0, 0, 0]);
     const dist = Array.from({ length: m }, () => Array.from({ length: n }, () => Infinity));
     dist[0][0] = 0;

solution/1600-1699/1631.Path With Minimum Effort/Solution3.ts

@@ -1,7 +1,7 @@
 function minimumEffortPath(heights: number[][]): number {
     const m = heights.length;
     const n = heights[0].length;
-    const pq = new PriorityQueue({ compare: (a, b) => a[0] - b[0] });
+    const pq = new PriorityQueue<number[]>((a, b) => a[0] - b[0]);
     pq.enqueue([0, 0, 0]);
     const dist = Array.from({ length: m }, () => Array.from({ length: n }, () => Infinity));
     dist[0][0] = 0;