GoLeetCode/solutions/1913/solution1913.go at main · CodeMonkey80s/GoLeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
package solution1913

import (
	"slices"
)

// ============================================================================
// 1408. String Matching in an Array
// URL: https://leetcode.com/problems/string-matching-in-an-array/
// ============================================================================

/*

	goos: linux
	goarch: amd64
	pkg: GoLeetCode/solutions/1913---Maximum-Product-Difference-Between-Two-Pairs
	cpu: 13th Gen Intel(R) Core(TM) i7-13700K
	Benchmark_maxProductDifference
	Benchmark_maxProductDifference-24    	100000000	        10.04 ns/op	       0 B/op	       0 allocs/op
	PASS

*/

func maxProductDifference(nums []int) int {
	slices.Sort(nums)
	a := nums[0]
	b := nums[1]
	c := nums[len(nums)-1]
	d := nums[len(nums)-2]
	return (c * d) - (a * b)
}