diff --git a/solution/1400-1499/1499.Max Value of Equation/README.md b/solution/1400-1499/1499.Max Value of Equation/README.md
index 7d434dd685253..5c64e21b6293c 100644
--- a/solution/1400-1499/1499.Max Value of Equation/README.md	
+++ b/solution/1400-1499/1499.Max Value of Equation/README.md	
@@ -44,11 +44,38 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
-**方法一：单调队列**
+**方法一：优先队列（大根堆）**
 
-区间（窗口）最值问题，使用单调队列优化。q 按 `y - x` 单调递减。
+题目要求 $y_i + y_j + |x_i - x_j|$ 的最大值，其中 $i \lt j$，并且 $|x_i - x_j| \leq k$。由于 $x_i$ 是严格单调递增的，那么：
 
-时间复杂度 $O(n)$。
+$$
+\begin{aligned}
+y_i + y_j + |x_i - x_j| & = y_i + y_j + x_j - x_i \\
+& = (y_i - x_i) + (x_j + y_j)
+\end{aligned}
+$$
+
+因此，对于当前遍历到的点 $(x_j, y_j)$，我们只需要找到前面所有满足 $x_j - x_i \leq k$ 的点 $(x_i, y_i)$ 中 $y_i - x_i$ 的最大值，再加上当前的 $x_j + y_j$ 即可。而 $y_i - x_i$ 的最大值，我们可以使用优先队列（大根堆）来维护。
+
+具体地，我们定义一个优先队列（大根堆） $pq$，堆中每个元素是一个二元组 $(y_i - x_i, x_i)$。
+
+当我们遍历到点 $(x, y)$ 时，如果堆 $pq$ 不为空，并且 $x - pq[0][1] \gt k$，那么循环将堆顶元素弹出，直到堆为空或者满足 $x - pq[0][1] \leq k$。此时，堆顶元素 $(y_i - x_i, x_i)$ 即为所有满足 $x_j - x_i \leq k$ 的点中 $y_i - x_i$ 的最大值，此时更新答案 $ans = \max(ans, x + y + pq[0][0])$。
+
+然后，我们将点 $(x, y)$ 加入堆中，继续遍历下一个点，直到遍历完整个数组 $points$。
+
+时间复杂度 $O(n \times \log n)$，空间复杂度 $O(n)$。其中 $n$ 是数组 $points$ 的长度。
+
+**方法二：单调队列**
+
+这道题实际上需要我们维护的是一个长度为 $k$ 的窗口中 $y-x$ 的最大值，单调队列可以很好地解决这个问题。
+
+具体地，我们定义一个单调队列 $q$，队列中每个元素是一个二元组 $(x_i, y_i)$。
+
+当我们遍历到点 $(x, y)$ 时，如果队列 $q$ 不为空，并且 $x - q[0][0] \gt k$，那么不断弹出队首元素，直到队列为空或者满足 $x - q[0][0] \leq k$。此时，队首元素 $(x_i, y_i)$ 即为所有满足 $x_j - x_i \leq k$ 的点中 $y_i - x_i$ 的最大值，此时更新答案 $ans = \max(ans, x + y + y_i - x_i)$。
+
+接下来，在将点 $(x, y)$ 加入队尾之前，我们将队列中所有 $y_i - x_i \leq y - x$ 的元素 $(x_i, y_i)$ 弹出队列，然后将点 $(x, y)$ 加入队尾。继续遍历下一个点，直到遍历完整个数组 $points$。
+
+时间复杂度 $O(n)$，空间复杂度 $O(n)$。其中 $n$ 是数组 $points$ 的长度。
 
 <!-- tabs:start -->
 
@@ -59,16 +86,30 @@
 ```python
 class Solution:
     def findMaxValueOfEquation(self, points: List[List[int]], k: int) -> int:
-        q = deque([points[0]])
         ans = -inf
-        for x, y in points[1:]:
+        pq = []
+        for x, y in points:
+            while pq and x - pq[0][1] > k:
+                heappop(pq)
+            if pq:
+                ans = max(ans, x + y - pq[0][0])
+            heappush(pq, (x - y, x))
+        return ans
+```
+
+```python
+class Solution:
+    def findMaxValueOfEquation(self, points: List[List[int]], k: int) -> int:
+        ans = -inf
+        q = deque()
+        for x, y in points:
             while q and x - q[0][0] > k:
                 q.popleft()
             if q:
                 ans = max(ans, x + y + q[0][1] - q[0][0])
-            while q and y - x > q[-1][1] - q[-1][0]:
+            while q and y - x >= q[-1][1] - q[-1][0]:
                 q.pop()
-            q.append([x, y])
+            q.append((x, y))
         return ans
 ```
 
@@ -79,20 +120,40 @@ class Solution:
 ```java
 class Solution {
     public int findMaxValueOfEquation(int[][] points, int k) {
+        int ans = -(1 << 30);
+        Priority<int[]> pq = new Priority<>((a, b) -> b[0] - a[0]);
+        for (var p : points) {
+            int x = p[0], y = p[1];
+            while (!hp.isEmpty() && x - hp.peek()[1] > k) {
+                hp.poll();
+            }
+            if (!hp.isEmpty()) {
+                ans = Math.max(ans, x + y + hp.peek()[0]);
+            }
+            hp.offer(new int[] {y - x, x});
+        }
+        return ans;
+    }
+}
+```
+
+```java
+class Solution {
+    public int findMaxValueOfEquation(int[][] points, int k) {
+        int ans = -(1 << 30);
         Deque<int[]> q = new ArrayDeque<>();
-        int ans = Integer.MIN_VALUE;
-        for (int[] p : points) {
+        for (var p : points) {
             int x = p[0], y = p[1];
             while (!q.isEmpty() && x - q.peekFirst()[0] > k) {
-                q.poll();
+                q.pollFirst();
             }
             if (!q.isEmpty()) {
-                ans = Math.max(ans, y + x + q.peekFirst()[1] - q.peekFirst()[0]);
+                ans = Math.max(ans, x + y + q.peekFirst()[1] - q.peekFirst()[0]);
             }
-            while (!q.isEmpty() && y - x > q.peekLast()[1] - q.peekLast()[0]) {
+            while (!q.isEmpty() && y - x >= q.peekLast()[1] - q.peekLast()[0]) {
                 q.pollLast();
             }
-            q.offer(p);
+            q.offerLast(p);
         }
         return ans;
     }
@@ -105,14 +166,41 @@ class Solution {
 class Solution {
 public:
     int findMaxValueOfEquation(vector<vector<int>>& points, int k) {
-        deque<vector<int>> q;
-        int ans = INT_MIN;
+        int ans = -(1 << 30);
+        priority_queue<pair<int, int>> pq;
         for (auto& p : points) {
             int x = p[0], y = p[1];
-            while (!q.empty() && x - q.front()[0] > k) q.pop_front();
-            if (!q.empty()) ans = max(ans, y + x + q.front()[1] - q.front()[0]);
-            while (!q.empty() && y - x > q.back()[1] - q.back()[0]) q.pop_back();
-            q.push_back(p);
+            while (pq.size() && x - pq.top().second > k) {
+                pq.pop();
+            }
+            if (pq.size()) {
+                ans = max(ans, x + y + pq.top().first);
+            }
+            pq.emplace(y - x, x);
+        }
+        return ans;
+    }
+};
+```
+
+```cpp
+class Solution {
+public:
+    int findMaxValueOfEquation(vector<vector<int>>& points, int k) {
+        int ans = -(1 << 30);
+        deque<pair<int, int>> q;
+        for (auto& p : points) {
+            int x = p[0], y = p[1];
+            while (!q.empty() && x - q.front().first > k) {
+                q.pop_front();
+            }
+            if (!q.empty()) {
+                ans = max(ans, x + y + q.front().second - q.front().first);
+            }
+            while (!q.empty() && y - x >= q.back().second - q.back().first) {
+                q.pop_back();
+            }
+            q.emplace_back(x, y);
         }
         return ans;
     }
@@ -123,20 +211,58 @@ public:
 
 ```go
 func findMaxValueOfEquation(points [][]int, k int) int {
-	q := [][]int{}
-	ans := math.MinInt32
+	ans := -(1 << 30)
+	hp := hp{}
+	for _, p := range points {
+		x, y := p[0], p[1]
+		for hp.Len() > 0 && x-hp[0].x > k {
+			heap.Pop(&hp)
+		}
+		if hp.Len() > 0 {
+			ans = max(ans, x+y+hp[0].v)
+		}
+		heap.Push(&hp, pair{y - x, x})
+	}
+	return ans
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+
+type pair struct{ v, x int }
+
+type hp []pair
+
+func (h hp) Len() int { return len(h) }
+func (h hp) Less(i, j int) bool {
+	a, b := h[i], h[j]
+	return a.v > b.v
+}
+func (h hp) Swap(i, j int)       { h[i], h[j] = h[j], h[i] }
+func (h *hp) Push(v interface{}) { *h = append(*h, v.(pair)) }
+func (h *hp) Pop() interface{}   { a := *h; v := a[len(a)-1]; *h = a[:len(a)-1]; return v }
+```
+
+```go
+func findMaxValueOfEquation(points [][]int, k int) int {
+	ans := -(1 << 30)
+	q := [][2]int{}
 	for _, p := range points {
 		x, y := p[0], p[1]
 		for len(q) > 0 && x-q[0][0] > k {
 			q = q[1:]
 		}
 		if len(q) > 0 {
-			ans = max(ans, y+x+q[0][1]-q[0][0])
+			ans = max(ans, x+y+q[0][1]-q[0][0])
 		}
-		for len(q) > 0 && y-x > q[len(q)-1][1]-q[len(q)-1][0] {
+		for len(q) > 0 && y-x >= q[len(q)-1][1]-q[len(q)-1][0] {
 			q = q[:len(q)-1]
 		}
-		q = append(q, p)
+		q = append(q, [2]int{x, y})
 	}
 	return ans
 }
@@ -149,6 +275,115 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function findMaxValueOfEquation(points: number[][], k: number): number {
+    let ans = -(1 << 30);
+    const pq = new Heap<[number, number]>((a, b) => b[0] - a[0]);
+    for (const [x, y] of points) {
+        while (pq.size() && x - pq.top()[1] > k) {
+            pq.pop();
+        }
+        if (pq.size()) {
+            ans = Math.max(ans, x + y + pq.top()[0]);
+        }
+        pq.push([y - x, x]);
+    }
+    return ans;
+}
+
+type Compare<T> = (lhs: T, rhs: T) => number;
+
+class Heap<T = number> {
+    data: Array<T | null>;
+    lt: (i: number, j: number) => boolean;
+    constructor();
+    constructor(data: T[]);
+    constructor(compare: Compare<T>);
+    constructor(data: T[], compare: Compare<T>);
+    constructor(data: T[] | Compare<T>, compare?: (lhs: T, rhs: T) => number);
+    constructor(
+        data: T[] | Compare<T> = [],
+        compare: Compare<T> = (lhs: T, rhs: T) =>
+            lhs < rhs ? -1 : lhs > rhs ? 1 : 0,
+    ) {
+        if (typeof data === 'function') {
+            compare = data;
+            data = [];
+        }
+        this.data = [null, ...data];
+        this.lt = (i, j) => compare(this.data[i]!, this.data[j]!) < 0;
+        for (let i = this.size(); i > 0; i--) this.heapify(i);
+    }
+
+    size(): number {
+        return this.data.length - 1;
+    }
+
+    push(v: T): void {
+        this.data.push(v);
+        let i = this.size();
+        while (i >> 1 !== 0 && this.lt(i, i >> 1)) this.swap(i, (i >>= 1));
+    }
+
+    pop(): T {
+        this.swap(1, this.size());
+        const top = this.data.pop();
+        this.heapify(1);
+        return top!;
+    }
+
+    top(): T {
+        return this.data[1]!;
+    }
+    heapify(i: number): void {
+        while (true) {
+            let min = i;
+            const [l, r, n] = [i * 2, i * 2 + 1, this.data.length];
+            if (l < n && this.lt(l, min)) min = l;
+            if (r < n && this.lt(r, min)) min = r;
+            if (min !== i) {
+                this.swap(i, min);
+                i = min;
+            } else break;
+        }
+    }
+
+    clear(): void {
+        this.data = [null];
+    }
+
+    private swap(i: number, j: number): void {
+        const d = this.data;
+        [d[i], d[j]] = [d[j], d[i]];
+    }
+}
+```
+
+```ts
+function findMaxValueOfEquation(points: number[][], k: number): number {
+    let ans = -(1 << 30);
+    const q: number[][] = [];
+    for (const [x, y] of points) {
+        while (q.length > 0 && x - q[0][0] > k) {
+            q.shift();
+        }
+        if (q.length > 0) {
+            ans = Math.max(ans, x + y + q[0][1] - q[0][0]);
+        }
+        while (
+            q.length > 0 &&
+            y - x > q[q.length - 1][1] - q[q.length - 1][0]
+        ) {
+            q.pop();
+        }
+        q.push([x, y]);
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```
diff --git a/solution/1400-1499/1499.Max Value of Equation/README_EN.md b/solution/1400-1499/1499.Max Value of Equation/README_EN.md
index 1fbcfeaa18b45..0a1e84a1a9f1c 100644
--- a/solution/1400-1499/1499.Max Value of Equation/README_EN.md	
+++ b/solution/1400-1499/1499.Max Value of Equation/README_EN.md	
@@ -49,16 +49,30 @@ No other pairs satisfy the condition, so we return the max of 4 and 1.
 ```python
 class Solution:
     def findMaxValueOfEquation(self, points: List[List[int]], k: int) -> int:
-        q = deque([points[0]])
         ans = -inf
-        for x, y in points[1:]:
+        pq = []
+        for x, y in points:
+            while pq and x - pq[0][1] > k:
+                heappop(pq)
+            if pq:
+                ans = max(ans, x + y - pq[0][0])
+            heappush(pq, (x - y, x))
+        return ans
+```
+
+```python
+class Solution:
+    def findMaxValueOfEquation(self, points: List[List[int]], k: int) -> int:
+        ans = -inf
+        q = deque()
+        for x, y in points:
             while q and x - q[0][0] > k:
                 q.popleft()
             if q:
                 ans = max(ans, x + y + q[0][1] - q[0][0])
-            while q and y - x > q[-1][1] - q[-1][0]:
+            while q and y - x >= q[-1][1] - q[-1][0]:
                 q.pop()
-            q.append([x, y])
+            q.append((x, y))
         return ans
 ```
 
@@ -67,20 +81,40 @@ class Solution:
 ```java
 class Solution {
     public int findMaxValueOfEquation(int[][] points, int k) {
+        int ans = -(1 << 30);
+        Priority<int[]> pq = new Priority<>((a, b) -> b[0] - a[0]);
+        for (var p : points) {
+            int x = p[0], y = p[1];
+            while (!hp.isEmpty() && x - hp.peek()[1] > k) {
+                hp.poll();
+            }
+            if (!hp.isEmpty()) {
+                ans = Math.max(ans, x + y + hp.peek()[0]);
+            }
+            hp.offer(new int[] {y - x, x});
+        }
+        return ans;
+    }
+}
+```
+
+```java
+class Solution {
+    public int findMaxValueOfEquation(int[][] points, int k) {
+        int ans = -(1 << 30);
         Deque<int[]> q = new ArrayDeque<>();
-        int ans = Integer.MIN_VALUE;
-        for (int[] p : points) {
+        for (var p : points) {
             int x = p[0], y = p[1];
             while (!q.isEmpty() && x - q.peekFirst()[0] > k) {
-                q.poll();
+                q.pollFirst();
             }
             if (!q.isEmpty()) {
-                ans = Math.max(ans, y + x + q.peekFirst()[1] - q.peekFirst()[0]);
+                ans = Math.max(ans, x + y + q.peekFirst()[1] - q.peekFirst()[0]);
             }
-            while (!q.isEmpty() && y - x > q.peekLast()[1] - q.peekLast()[0]) {
+            while (!q.isEmpty() && y - x >= q.peekLast()[1] - q.peekLast()[0]) {
                 q.pollLast();
             }
-            q.offer(p);
+            q.offerLast(p);
         }
         return ans;
     }
@@ -93,14 +127,41 @@ class Solution {
 class Solution {
 public:
     int findMaxValueOfEquation(vector<vector<int>>& points, int k) {
-        deque<vector<int>> q;
-        int ans = INT_MIN;
+        int ans = -(1 << 30);
+        priority_queue<pair<int, int>> pq;
+        for (auto& p : points) {
+            int x = p[0], y = p[1];
+            while (pq.size() && x - pq.top().second > k) {
+                pq.pop();
+            }
+            if (pq.size()) {
+                ans = max(ans, x + y + pq.top().first);
+            }
+            pq.emplace(y - x, x);
+        }
+        return ans;
+    }
+};
+```
+
+```cpp
+class Solution {
+public:
+    int findMaxValueOfEquation(vector<vector<int>>& points, int k) {
+        int ans = -(1 << 30);
+        deque<pair<int, int>> q;
         for (auto& p : points) {
             int x = p[0], y = p[1];
-            while (!q.empty() && x - q.front()[0] > k) q.pop_front();
-            if (!q.empty()) ans = max(ans, y + x + q.front()[1] - q.front()[0]);
-            while (!q.empty() && y - x > q.back()[1] - q.back()[0]) q.pop_back();
-            q.push_back(p);
+            while (!q.empty() && x - q.front().first > k) {
+                q.pop_front();
+            }
+            if (!q.empty()) {
+                ans = max(ans, x + y + q.front().second - q.front().first);
+            }
+            while (!q.empty() && y - x >= q.back().second - q.back().first) {
+                q.pop_back();
+            }
+            q.emplace_back(x, y);
         }
         return ans;
     }
@@ -111,20 +172,58 @@ public:
 
 ```go
 func findMaxValueOfEquation(points [][]int, k int) int {
-	q := [][]int{}
-	ans := math.MinInt32
+	ans := -(1 << 30)
+	hp := hp{}
+	for _, p := range points {
+		x, y := p[0], p[1]
+		for hp.Len() > 0 && x-hp[0].x > k {
+			heap.Pop(&hp)
+		}
+		if hp.Len() > 0 {
+			ans = max(ans, x+y+hp[0].v)
+		}
+		heap.Push(&hp, pair{y - x, x})
+	}
+	return ans
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+
+type pair struct{ v, x int }
+
+type hp []pair
+
+func (h hp) Len() int { return len(h) }
+func (h hp) Less(i, j int) bool {
+	a, b := h[i], h[j]
+	return a.v > b.v
+}
+func (h hp) Swap(i, j int)       { h[i], h[j] = h[j], h[i] }
+func (h *hp) Push(v interface{}) { *h = append(*h, v.(pair)) }
+func (h *hp) Pop() interface{}   { a := *h; v := a[len(a)-1]; *h = a[:len(a)-1]; return v }
+```
+
+```go
+func findMaxValueOfEquation(points [][]int, k int) int {
+	ans := -(1 << 30)
+	q := [][2]int{}
 	for _, p := range points {
 		x, y := p[0], p[1]
 		for len(q) > 0 && x-q[0][0] > k {
 			q = q[1:]
 		}
 		if len(q) > 0 {
-			ans = max(ans, y+x+q[0][1]-q[0][0])
+			ans = max(ans, x+y+q[0][1]-q[0][0])
 		}
-		for len(q) > 0 && y-x > q[len(q)-1][1]-q[len(q)-1][0] {
+		for len(q) > 0 && y-x >= q[len(q)-1][1]-q[len(q)-1][0] {
 			q = q[:len(q)-1]
 		}
-		q = append(q, p)
+		q = append(q, [2]int{x, y})
 	}
 	return ans
 }
@@ -137,6 +236,115 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function findMaxValueOfEquation(points: number[][], k: number): number {
+    let ans = -(1 << 30);
+    const pq = new Heap<[number, number]>((a, b) => b[0] - a[0]);
+    for (const [x, y] of points) {
+        while (pq.size() && x - pq.top()[1] > k) {
+            pq.pop();
+        }
+        if (pq.size()) {
+            ans = Math.max(ans, x + y + pq.top()[0]);
+        }
+        pq.push([y - x, x]);
+    }
+    return ans;
+}
+
+type Compare<T> = (lhs: T, rhs: T) => number;
+
+class Heap<T = number> {
+    data: Array<T | null>;
+    lt: (i: number, j: number) => boolean;
+    constructor();
+    constructor(data: T[]);
+    constructor(compare: Compare<T>);
+    constructor(data: T[], compare: Compare<T>);
+    constructor(data: T[] | Compare<T>, compare?: (lhs: T, rhs: T) => number);
+    constructor(
+        data: T[] | Compare<T> = [],
+        compare: Compare<T> = (lhs: T, rhs: T) =>
+            lhs < rhs ? -1 : lhs > rhs ? 1 : 0,
+    ) {
+        if (typeof data === 'function') {
+            compare = data;
+            data = [];
+        }
+        this.data = [null, ...data];
+        this.lt = (i, j) => compare(this.data[i]!, this.data[j]!) < 0;
+        for (let i = this.size(); i > 0; i--) this.heapify(i);
+    }
+
+    size(): number {
+        return this.data.length - 1;
+    }
+
+    push(v: T): void {
+        this.data.push(v);
+        let i = this.size();
+        while (i >> 1 !== 0 && this.lt(i, i >> 1)) this.swap(i, (i >>= 1));
+    }
+
+    pop(): T {
+        this.swap(1, this.size());
+        const top = this.data.pop();
+        this.heapify(1);
+        return top!;
+    }
+
+    top(): T {
+        return this.data[1]!;
+    }
+    heapify(i: number): void {
+        while (true) {
+            let min = i;
+            const [l, r, n] = [i * 2, i * 2 + 1, this.data.length];
+            if (l < n && this.lt(l, min)) min = l;
+            if (r < n && this.lt(r, min)) min = r;
+            if (min !== i) {
+                this.swap(i, min);
+                i = min;
+            } else break;
+        }
+    }
+
+    clear(): void {
+        this.data = [null];
+    }
+
+    private swap(i: number, j: number): void {
+        const d = this.data;
+        [d[i], d[j]] = [d[j], d[i]];
+    }
+}
+```
+
+```ts
+function findMaxValueOfEquation(points: number[][], k: number): number {
+    let ans = -(1 << 30);
+    const q: number[][] = [];
+    for (const [x, y] of points) {
+        while (q.length > 0 && x - q[0][0] > k) {
+            q.shift();
+        }
+        if (q.length > 0) {
+            ans = Math.max(ans, x + y + q[0][1] - q[0][0]);
+        }
+        while (
+            q.length > 0 &&
+            y - x > q[q.length - 1][1] - q[q.length - 1][0]
+        ) {
+            q.pop();
+        }
+        q.push([x, y]);
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```
diff --git a/solution/1400-1499/1499.Max Value of Equation/Solution.cpp b/solution/1400-1499/1499.Max Value of Equation/Solution.cpp
index 07b99cc43646d..8c51b81e68951 100644
--- a/solution/1400-1499/1499.Max Value of Equation/Solution.cpp	
+++ b/solution/1400-1499/1499.Max Value of Equation/Solution.cpp	
@@ -1,15 +1,21 @@
-class Solution {
-public:
-    int findMaxValueOfEquation(vector<vector<int>>& points, int k) {
-        deque<vector<int>> q;
-        int ans = INT_MIN;
-        for (auto& p : points) {
-            int x = p[0], y = p[1];
-            while (!q.empty() && x - q.front()[0] > k) q.pop_front();
-            if (!q.empty()) ans = max(ans, y + x + q.front()[1] - q.front()[0]);
-            while (!q.empty() && y - x > q.back()[1] - q.back()[0]) q.pop_back();
-            q.push_back(p);
-        }
-        return ans;
-    }
+class Solution {
+public:
+    int findMaxValueOfEquation(vector<vector<int>>& points, int k) {
+        int ans = -(1 << 30);
+        deque<pair<int, int>> q;
+        for (auto& p : points) {
+            int x = p[0], y = p[1];
+            while (!q.empty() && x - q.front().first > k) {
+                q.pop_front();
+            }
+            if (!q.empty()) {
+                ans = max(ans, x + y + q.front().second - q.front().first);
+            }
+            while (!q.empty() && y - x >= q.back().second - q.back().first) {
+                q.pop_back();
+            }
+            q.emplace_back(x, y);
+        }
+        return ans;
+    }
 };
\ No newline at end of file
diff --git a/solution/1400-1499/1499.Max Value of Equation/Solution.go b/solution/1400-1499/1499.Max Value of Equation/Solution.go
index 1068a9f1c92eb..2b52427629859 100644
--- a/solution/1400-1499/1499.Max Value of Equation/Solution.go	
+++ b/solution/1400-1499/1499.Max Value of Equation/Solution.go	
@@ -1,18 +1,18 @@
 func findMaxValueOfEquation(points [][]int, k int) int {
-	q := [][]int{}
-	ans := math.MinInt32
+	ans := -(1 << 30)
+	q := [][2]int{}
 	for _, p := range points {
 		x, y := p[0], p[1]
 		for len(q) > 0 && x-q[0][0] > k {
 			q = q[1:]
 		}
 		if len(q) > 0 {
-			ans = max(ans, y+x+q[0][1]-q[0][0])
+			ans = max(ans, x+y+q[0][1]-q[0][0])
 		}
-		for len(q) > 0 && y-x > q[len(q)-1][1]-q[len(q)-1][0] {
+		for len(q) > 0 && y-x >= q[len(q)-1][1]-q[len(q)-1][0] {
 			q = q[:len(q)-1]
 		}
-		q = append(q, p)
+		q = append(q, [2]int{x, y})
 	}
 	return ans
 }
diff --git a/solution/1400-1499/1499.Max Value of Equation/Solution.java b/solution/1400-1499/1499.Max Value of Equation/Solution.java
index 4ddbe868f1b45..38297e3c2dc86 100644
--- a/solution/1400-1499/1499.Max Value of Equation/Solution.java	
+++ b/solution/1400-1499/1499.Max Value of Equation/Solution.java	
@@ -1,20 +1,20 @@
-class Solution {
-    public int findMaxValueOfEquation(int[][] points, int k) {
-        Deque<int[]> q = new ArrayDeque<>();
-        int ans = Integer.MIN_VALUE;
-        for (int[] p : points) {
-            int x = p[0], y = p[1];
-            while (!q.isEmpty() && x - q.peekFirst()[0] > k) {
-                q.poll();
-            }
-            if (!q.isEmpty()) {
-                ans = Math.max(ans, y + x + q.peekFirst()[1] - q.peekFirst()[0]);
-            }
-            while (!q.isEmpty() && y - x > q.peekLast()[1] - q.peekLast()[0]) {
-                q.pollLast();
-            }
-            q.offer(p);
-        }
-        return ans;
-    }
+class Solution {
+    public int findMaxValueOfEquation(int[][] points, int k) {
+        int ans = -(1 << 30);
+        Deque<int[]> q = new ArrayDeque<>();
+        for (var p : points) {
+            int x = p[0], y = p[1];
+            while (!q.isEmpty() && x - q.peekFirst()[0] > k) {
+                q.pollFirst();
+            }
+            if (!q.isEmpty()) {
+                ans = Math.max(ans, x + y + q.peekFirst()[1] - q.peekFirst()[0]);
+            }
+            while (!q.isEmpty() && y - x >= q.peekLast()[1] - q.peekLast()[0]) {
+                q.pollLast();
+            }
+            q.offerLast(p);
+        }
+        return ans;
+    }
 }
\ No newline at end of file
diff --git a/solution/1400-1499/1499.Max Value of Equation/Solution.py b/solution/1400-1499/1499.Max Value of Equation/Solution.py
index 42ba38c36ef52..a353053c9529f 100644
--- a/solution/1400-1499/1499.Max Value of Equation/Solution.py	
+++ b/solution/1400-1499/1499.Max Value of Equation/Solution.py	
@@ -1,13 +1,13 @@
-class Solution:
-    def findMaxValueOfEquation(self, points: List[List[int]], k: int) -> int:
-        q = deque([points[0]])
-        ans = -inf
-        for x, y in points[1:]:
-            while q and x - q[0][0] > k:
-                q.popleft()
-            if q:
-                ans = max(ans, x + y + q[0][1] - q[0][0])
-            while q and y - x > q[-1][1] - q[-1][0]:
-                q.pop()
-            q.append([x, y])
-        return ans
+class Solution:
+    def findMaxValueOfEquation(self, points: List[List[int]], k: int) -> int:
+        ans = -inf
+        q = deque()
+        for x, y in points:
+            while q and x - q[0][0] > k:
+                q.popleft()
+            if q:
+                ans = max(ans, x + y + q[0][1] - q[0][0])
+            while q and y - x >= q[-1][1] - q[-1][0]:
+                q.pop()
+            q.append((x, y))
+        return ans
diff --git a/solution/1400-1499/1499.Max Value of Equation/Solution.ts b/solution/1400-1499/1499.Max Value of Equation/Solution.ts
new file mode 100644
index 0000000000000..1bfe03a76f8f0
--- /dev/null
+++ b/solution/1400-1499/1499.Max Value of Equation/Solution.ts	
@@ -0,0 +1,20 @@
+function findMaxValueOfEquation(points: number[][], k: number): number {
+    let ans = -(1 << 30);
+    const q: number[][] = [];
+    for (const [x, y] of points) {
+        while (q.length > 0 && x - q[0][0] > k) {
+            q.shift();
+        }
+        if (q.length > 0) {
+            ans = Math.max(ans, x + y + q[0][1] - q[0][0]);
+        }
+        while (
+            q.length > 0 &&
+            y - x > q[q.length - 1][1] - q[q.length - 1][0]
+        ) {
+            q.pop();
+        }
+        q.push([x, y]);
+    }
+    return ans;
+}