feat: add solutions to lc problem: No.1877 (#1061)

No.1877.Minimize Maximum Pair Sum in Array

Author: yanglbme

solution/1800-1899/1877.Minimize Maximum Pair Sum in Array/README.md

@@ -54,7 +54,13 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
-排序 + 贪心。
+**方法一：贪心**
+
+要使得数组中最大数对和的值最小，那么我们可以将数组中最小的数和最大的数配对，次小的数和次大的数配对，依此类推。
+
+因此，我们可以先对数组进行排序，然后使用两个指针分别指向数组的两端，求出两个指针指向的数的和，更新最大数对和的值，然后将左指针右移一位，右指针左移一位，继续进行操作，直到两个指针相遇为止，即可得到最小的最大数对和。
+
+时间复杂度 $O(n \times \log n)$，空间复杂度 $O(\log n)$。其中 $n$ 是数组的长度。
 
 <!-- tabs:start -->
 
@@ -66,10 +72,8 @@
 class Solution:
     def minPairSum(self, nums: List[int]) -> int:
         nums.sort()
-        res, n = 0, len(nums)
-        for i in range(n >> 1):
-            res = max(res, nums[i] + nums[n - i - 1])
-        return res
+        n = len(nums)
+        return max(x + nums[n - i - 1] for i, x in enumerate(nums[: n >> 1]))
 ```
 
 ### **Java**
@@ -80,11 +84,11 @@ class Solution:
 class Solution {
     public int minPairSum(int[] nums) {
         Arrays.sort(nums);
-        int res = 0, n = nums.length;
-        for (int i = 0; i < (n >> 1); ++i) {
-            res = Math.max(res, nums[i] + nums[n - i - 1]);
+        int ans = 0, n = nums.length;
+        for (int i = 0; i < n >> 1; ++i) {
+            ans = Math.max(ans, nums[i] + nums[n - i - 1]);
         }
-        return res;
+        return ans;
     }
 }
 ```
@@ -96,25 +100,25 @@ class Solution {
 public:
     int minPairSum(vector<int>& nums) {
         sort(nums.begin(), nums.end());
-        int res = 0, n = nums.size();
-        for (int i = 0; i < (n >> 1); ++i) {
-            res = max(res, nums[i] + nums[n - i - 1]);
+        int ans = 0, n = nums.size();
+        for (int i = 0; i < n >> 1; ++i) {
+            ans = max(ans, nums[i] + nums[n - i - 1]);
         }
-        return res;
+        return ans;
     }
 };
 ```
 
 ### **Go**
 
 ```go
-func minPairSum(nums []int) int {
+func minPairSum(nums []int) (ans int) {
 	sort.Ints(nums)
-	res, n := 0, len(nums)
-	for i := 0; i < (n >> 1); i++ {
-		res = max(res, nums[i]+nums[n-i-1])
+	n := len(nums)
+	for i, x := range nums[:n>>1] {
+		ans = max(ans, x+nums[n-1-i])
 	}
-	return res
+	return
 }
 
 func max(a, b int) int {
@@ -125,6 +129,20 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function minPairSum(nums: number[]): number {
+    nums.sort((a, b) => a - b);
+    let ans = 0;
+    const n = nums.length;
+    for (let i = 0; i < n >> 1; ++i) {
+        ans = Math.max(ans, nums[i] + nums[n - 1 - i]);
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/1800-1899/1877.Minimize Maximum Pair Sum in Array/README_EN.md

@@ -60,10 +60,8 @@ Sort & Greedy.
 class Solution:
     def minPairSum(self, nums: List[int]) -> int:
         nums.sort()
-        res, n = 0, len(nums)
-        for i in range(n >> 1):
-            res = max(res, nums[i] + nums[n - i - 1])
-        return res
+        n = len(nums)
+        return max(x + nums[n - i - 1] for i, x in enumerate(nums[: n >> 1]))
 ```
 
 ### **Java**
@@ -72,11 +70,11 @@ class Solution:
 class Solution {
     public int minPairSum(int[] nums) {
         Arrays.sort(nums);
-        int res = 0, n = nums.length;
-        for (int i = 0; i < (n >> 1); ++i) {
-            res = Math.max(res, nums[i] + nums[n - i - 1]);
+        int ans = 0, n = nums.length;
+        for (int i = 0; i < n >> 1; ++i) {
+            ans = Math.max(ans, nums[i] + nums[n - i - 1]);
         }
-        return res;
+        return ans;
     }
 }
 ```
@@ -88,25 +86,25 @@ class Solution {
 public:
     int minPairSum(vector<int>& nums) {
         sort(nums.begin(), nums.end());
-        int res = 0, n = nums.size();
-        for (int i = 0; i < (n >> 1); ++i) {
-            res = max(res, nums[i] + nums[n - i - 1]);
+        int ans = 0, n = nums.size();
+        for (int i = 0; i < n >> 1; ++i) {
+            ans = max(ans, nums[i] + nums[n - i - 1]);
         }
-        return res;
+        return ans;
     }
 };
 ```
 
 ### **Go**
 
 ```go
-func minPairSum(nums []int) int {
+func minPairSum(nums []int) (ans int) {
 	sort.Ints(nums)
-	res, n := 0, len(nums)
-	for i := 0; i < (n >> 1); i++ {
-		res = max(res, nums[i]+nums[n-i-1])
+	n := len(nums)
+	for i, x := range nums[:n>>1] {
+		ans = max(ans, x+nums[n-1-i])
 	}
-	return res
+	return
 }
 
 func max(a, b int) int {
@@ -117,6 +115,20 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function minPairSum(nums: number[]): number {
+    nums.sort((a, b) => a - b);
+    let ans = 0;
+    const n = nums.length;
+    for (let i = 0; i < n >> 1; ++i) {
+        ans = Math.max(ans, nums[i] + nums[n - 1 - i]);
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/1800-1899/1877.Minimize Maximum Pair Sum in Array/Solution.cpp

@@ -2,10 +2,10 @@ class Solution {
 public:
     int minPairSum(vector<int>& nums) {
         sort(nums.begin(), nums.end());
-        int res = 0, n = nums.size();
-        for (int i = 0; i < (n >> 1); ++i) {
-            res = max(res, nums[i] + nums[n - i - 1]);
+        int ans = 0, n = nums.size();
+        for (int i = 0; i < n >> 1; ++i) {
+            ans = max(ans, nums[i] + nums[n - i - 1]);
         }
-        return res;
+        return ans;
     }
 };

solution/1800-1899/1877.Minimize Maximum Pair Sum in Array/Solution.go

@@ -1,10 +1,10 @@
-func minPairSum(nums []int) int {
+func minPairSum(nums []int) (ans int) {
 	sort.Ints(nums)
-	res, n := 0, len(nums)
-	for i := 0; i < (n >> 1); i++ {
-		res = max(res, nums[i]+nums[n-i-1])
+	n := len(nums)
+	for i, x := range nums[:n>>1] {
+		ans = max(ans, x+nums[n-1-i])
 	}
-	return res
+	return
 }
 
 func max(a, b int) int {

solution/1800-1899/1877.Minimize Maximum Pair Sum in Array/Solution.java

@@ -1,10 +1,10 @@
 class Solution {
     public int minPairSum(int[] nums) {
         Arrays.sort(nums);
-        int res = 0, n = nums.length;
-        for (int i = 0; i < (n >> 1); ++i) {
-            res = Math.max(res, nums[i] + nums[n - i - 1]);
+        int ans = 0, n = nums.length;
+        for (int i = 0; i < n >> 1; ++i) {
+            ans = Math.max(ans, nums[i] + nums[n - i - 1]);
         }
-        return res;
+        return ans;
     }
 }

solution/1800-1899/1877.Minimize Maximum Pair Sum in Array/Solution.py

@@ -1,7 +1,5 @@
 class Solution:
     def minPairSum(self, nums: List[int]) -> int:
         nums.sort()
-        res, n = 0, len(nums)
-        for i in range(n >> 1):
-            res = max(res, nums[i] + nums[n - i - 1])
-        return res
+        n = len(nums)
+        return max(x + nums[n - i - 1] for i, x in enumerate(nums[: n >> 1]))

solution/1800-1899/1877.Minimize Maximum Pair Sum in Array/Solution.ts

@@ -0,0 +1,9 @@
+function minPairSum(nums: number[]): number {
+    nums.sort((a, b) => a - b);
+    let ans = 0;
+    const n = nums.length;
+    for (let i = 0; i < n >> 1; ++i) {
+        ans = Math.max(ans, nums[i] + nums[n - 1 - i]);
+    }
+    return ans;
+}