✨2644.找出可整除性得分最大的整数

Author: techoc

README.md

@@ -133,6 +133,7 @@
 - [2578.最小和分割](leetcode/easy/t2578/solution.go))
 - [2586.统计范围内的元音字符串数](leetcode/easy/t2586/solution.go)
 - [2609.最长平衡子字符串](leetcode/easy/t2609/solution.go)
+- [2644.找出可整除性得分最大的整数](leetcode/easy/t2644/solution.go)
 - [2656.K 个元素的最大和](leetcode/easy/t2656/solution.go)
 - [2706.购买两块巧克力](leetcode/easy/t2706/solution.go)
 - [2739.总行驶距离](leetcode/easy/t2739/solution.go)

leetcode/easy/t2644/solution.go

@@ -0,0 +1,20 @@
+package t2644
+
+// 2644. 找出可整除性得分最大的整数
+// https://leetcode.cn/problems/find-the-maximum-divisibility-score
+func maxDivScore(nums []int, divisors []int) int {
+	res, res_count := divisors[0], 0
+	for _, value := range divisors {
+		count := 0
+		for _, num := range nums {
+			if num%value == 0 { // 整除
+				count++
+			}
+		}
+		if count > res_count || (count == res_count && value < res) {
+			res = value
+			res_count = count
+		}
+	}
+	return res
+}

leetcode/easy/t2644/solution_test.go

@@ -0,0 +1,38 @@
+package t2644
+
+import "testing"
+
+func TestMaxDivScore(t *testing.T) {
+	tests := []struct {
+		name     string
+		nums     []int
+		divisors []int
+		want     int
+	}{
+		{
+			name:     "Case 1",
+			nums:     []int{4, 7, 9, 3, 9},
+			divisors: []int{5, 2, 3},
+			want:     3,
+		},
+		{
+			name:     "Case 2",
+			nums:     []int{20, 14, 21, 10},
+			divisors: []int{5, 7, 5},
+			want:     5,
+		},
+		{
+			name:     "Case 3",
+			nums:     []int{12},
+			divisors: []int{10, 16},
+			want:     10,
+		},
+	}
+	for _, tt := range tests {
+		t.Run(tt.name, func(t *testing.T) {
+			if got := maxDivScore(tt.nums, tt.divisors); got != tt.want {
+				t.Errorf("maxDivScore() = %v, want %v", got, tt.want)
+			}
+		})
+	}
+}