Add solution 1603、1608、1700、1710、1716、1720、1725、1732、1736、1742、1748、1752、1758

leetcode/1742.Maximum-Number-of-Balls-in-a-Box/1742. Maximum Number of Balls in a Box.go

@@ -0,0 +1,17 @@
+package leetcode
+
+func countBalls(lowLimit int, highLimit int) int {
+	buckets, maxBall := [46]int{}, 0
+	for i := lowLimit; i <= highLimit; i++ {
+		t := 0
+		for j := i; j > 0; {
+			t += j % 10
+			j = j / 10
+		}
+		buckets[t]++
+		if buckets[t] > maxBall {
+			maxBall = buckets[t]
+		}
+	}
+	return maxBall
+}

leetcode/1742.Maximum-Number-of-Balls-in-a-Box/1742. Maximum Number of Balls in a Box_test.go

@@ -0,0 +1,53 @@
+package leetcode
+
+import (
+	"fmt"
+	"testing"
+)
+
+type question1742 struct {
+	para1742
+	ans1742
+}
+
+// para 是参数
+// one 代表第一个参数
+type para1742 struct {
+	lowLimit  int
+	highLimit int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans1742 struct {
+	one int
+}
+
+func Test_Problem1742(t *testing.T) {
+
+	qs := []question1742{
+
+		{
+			para1742{1, 10},
+			ans1742{2},
+		},
+
+		{
+			para1742{5, 15},
+			ans1742{2},
+		},
+
+		{
+			para1742{19, 28},
+			ans1742{2},
+		},
+	}
+
+	fmt.Printf("------------------------Leetcode Problem 1742------------------------\n")
+
+	for _, q := range qs {
+		_, p := q.ans1742, q.para1742
+		fmt.Printf("【input】:%v       【output】:%v\n", p, countBalls(p.lowLimit, p.highLimit))
+	}
+	fmt.Printf("\n\n\n")
+}

leetcode/1742.Maximum-Number-of-Balls-in-a-Box/README.md

@@ -0,0 +1,81 @@
+# [1742. Maximum Number of Balls in a Box](https://leetcode.com/problems/maximum-number-of-balls-in-a-box/)
+
+
+## 题目
+
+You are working in a ball factory where you have `n` balls numbered from `lowLimit` up to `highLimit` **inclusive** (i.e., `n == highLimit - lowLimit + 1`), and an infinite number of boxes numbered from `1` to `infinity`.
+
+Your job at this factory is to put each ball in the box with a number equal to the sum of digits of the ball's number. For example, the ball number `321` will be put in the box number `3 + 2 + 1 = 6` and the ball number `10` will be put in the box number `1 + 0 = 1`.
+
+Given two integers `lowLimit` and `highLimit`, return *the number of balls in the box with the most balls.*
+
+**Example 1:**
+
+```
+Input: lowLimit = 1, highLimit = 10
+Output: 2
+Explanation:
+Box Number:  1 2 3 4 5 6 7 8 9 10 11 ...
+Ball Count:  2 1 1 1 1 1 1 1 1 0  0  ...
+Box 1 has the most number of balls with 2 balls.
+```
+
+**Example 2:**
+
+```
+Input: lowLimit = 5, highLimit = 15
+Output: 2
+Explanation:
+Box Number:  1 2 3 4 5 6 7 8 9 10 11 ...
+Ball Count:  1 1 1 1 2 2 1 1 1 0  0  ...
+Boxes 5 and 6 have the most number of balls with 2 balls in each.
+
+```
+
+**Example 3:**
+
+```
+Input: lowLimit = 19, highLimit = 28
+Output: 2
+Explanation:
+Box Number:  1 2 3 4 5 6 7 8 9 10 11 12 ...
+Ball Count:  0 1 1 1 1 1 1 1 1 2  0  0  ...
+Box 10 has the most number of balls with 2 balls.
+
+```
+
+**Constraints:**
+
+- `1 <= lowLimit <= highLimit <= 10^5`
+
+## 题目大意
+
+你在一家生产小球的玩具厂工作，有 n 个小球，编号从 lowLimit 开始，到 highLimit 结束（包括 lowLimit 和 highLimit ，即 n == highLimit - lowLimit + 1）。另有无限数量的盒子，编号从 1 到 infinity 。你的工作是将每个小球放入盒子中，其中盒子的编号应当等于小球编号上每位数字的和。例如，编号 321 的小球应当放入编号 3 + 2 + 1 = 6 的盒子，而编号 10 的小球应当放入编号 1 + 0 = 1 的盒子。
+
+给你两个整数 lowLimit 和 highLimit ，返回放有最多小球的盒子中的小球数量。如果有多个盒子都满足放有最多小球，只需返回其中任一盒子的小球数量。
+
+## 解题思路
+
+- 简单题。循环遍历一遍数组，依次计算出所有小球的编号各位数字累加和，并且动态维护放有小球最多的数目。循环结束，输出最多小球个数即可。
+
+## 代码
+
+```go
+package leetcode
+
+func countBalls(lowLimit int, highLimit int) int {
+	buckets, maxBall := [46]int{}, 0
+	for i := lowLimit; i <= highLimit; i++ {
+		t := 0
+		for j := i; j > 0; {
+			t += j % 10
+			j = j / 10
+		}
+		buckets[t]++
+		if buckets[t] > maxBall {
+			maxBall = buckets[t]
+		}
+	}
+	return maxBall
+}
+```