https://leetcode.cn/problems/maximum-product-of-two-elements-in-an-array/

Author: masx200

README.md

@@ -10,6 +10,8 @@ leetcode 测试
 
 ##### 包含的内容如下
 
+https://leetcode.cn/problems/maximum-product-of-two-elements-in-an-array/
+
 https://leetcode.cn/problems/find-k-closest-elements/
 
 https://leetcode.cn/problems/k-closest-points-to-origin/

maximum-product-of-two-elements-in-an-array/index.ts

@@ -0,0 +1,14 @@
+export default function maxProduct(nums: number[]): number {
+    const max_pair = nums.reduce(
+        (a, v, i): [number, number] => v > a[1] ? [i, v] : a,
+        [0, nums[0]] as [number, number],
+    );
+
+    nums.splice(max_pair[0], 1);
+    const sec_max_pair = nums.reduce(
+        (a, v, i): [number, number] => v > a[1] ? [i, v] : a,
+        [0, nums[0]] as [number, number],
+    );
+
+    return (sec_max_pair[1] - 1) * (max_pair[1] - 1);
+}