Merge pull request #19 from vivekv96/1464-max-products

Leetcode Problem #1464: Maximum Product

Author: vivekv96

easy/1464-max-products/main.go

@@ -0,0 +1,18 @@
+// Problem: https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/
+package main
+
+import (
+	"sort"
+)
+
+func maxProduct(nums []int) (product int) {
+	if len(nums) == 2 {
+		return (nums[0] - 1) * (nums[1] - 1)
+	}
+
+	sort.Ints(nums)
+
+	product = (nums[len(nums)-1] - 1) * (nums[len(nums)-2] - 1)
+
+	return
+}

easy/1464-max-products/main_test.go

@@ -0,0 +1,39 @@
+package main
+
+import "testing"
+
+func Test_maxProduct(t *testing.T) {
+	type args struct {
+		nums []int
+	}
+
+	tests := []struct {
+		name string
+		args args
+		want int
+	}{
+		{
+			name: "first case",
+			args: args{nums: []int{3, 4, 5, 2}},
+			want: 12,
+		},
+		{
+			name: "second case",
+			args: args{nums: []int{1, 5, 4, 5}},
+			want: 16,
+		},
+		{
+			name: "third case",
+			args: args{nums: []int{3, 7}},
+			want: 12,
+		},
+	}
+
+	for _, tt := range tests {
+		t.Run(tt.name, func(t *testing.T) {
+			if got := maxProduct(tt.args.nums); got != tt.want {
+				t.Errorf("maxProduct() = %v, want %v", got, tt.want)
+			}
+		})
+	}
+}