Add solution and test-cases for problem 2652

Author: 0xff-dev

leetcode/2601-2700/2652.Sum-Multiples/README.md

@@ -0,0 +1,37 @@
+# [2652.Sum Multiples][title]
+
+## Description
+Given a positive integer `n`, find the sum of all integers in the range `[1, n]` **inclusive** that are divisible by `3`, `5`, or `7`.
+
+Return an integer denoting the sum of all numbers in the given range satisfying the constraint.
+
+**Example 1:**
+
+```
+Input: n = 7
+Output: 21
+Explanation: Numbers in the range [1, 7] that are divisible by 3, 5, or 7 are 3, 5, 6, 7. The sum of these numbers is 21.
+```
+
+**Example 2:**
+
+```
+Input: n = 10
+Output: 40
+Explanation: Numbers in the range [1, 10] that are divisible by 3, 5, or 7 are 3, 5, 6, 7, 9, 10. The sum of these numbers is 40.
+```
+
+**Example 3:**
+
+```
+Input: n = 9
+Output: 30
+Explanation: Numbers in the range [1, 9] that are divisible by 3, 5, or 7 are 3, 5, 6, 7, 9. The sum of these numbers is 30.
+```
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://leetcode.com/problems/sum-multiples
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

leetcode/2601-2700/2652.Sum-Multiples/Solution.go

@@ -1,5 +1,11 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+func Solution(n int) int {
+	sum := 0
+	for i := 1; i <= n; i++ {
+		if i%3 == 0 || i%5 == 0 || i%7 == 0 {
+			sum += i
+		}
+	}
+	return sum
 }

leetcode/2601-2700/2652.Sum-Multiples/Solution_test.go

@@ -10,12 +10,12 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
-		expect bool
+		inputs int
+		expect int
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase1", 7, 21},
+		{"TestCase2", 9, 30},
+		{"TestCase3", 10, 40},
 	}
 
 	//	开始测试
@@ -30,10 +30,10 @@ func TestSolution(t *testing.T) {
 	}
 }
 
-//	压力测试
+// 压力测试
 func BenchmarkSolution(b *testing.B) {
 }
 
-//	使用案列
+// 使用案列
 func ExampleSolution() {
 }