From 527d474f62300ba1d756a80cd0f27ca6bffdbf06 Mon Sep 17 00:00:00 2001 From: yanglbme Date: Thu, 13 Feb 2025 08:44:19 +0800 Subject: [PATCH] feat: add solutions to lc problem: No.1742 No.1742.Maximum Number of Balls in a Box --- .../README.md | 67 ++++++++++++++++++- .../README_EN.md | 67 ++++++++++++++++++- .../Solution.cs | 15 +++++ .../Solution.js | 16 +++++ .../Solution.rs | 15 +++++ 5 files changed, 174 insertions(+), 6 deletions(-) create mode 100644 solution/1700-1799/1742.Maximum Number of Balls in a Box/Solution.cs create mode 100644 solution/1700-1799/1742.Maximum Number of Balls in a Box/Solution.js create mode 100644 solution/1700-1799/1742.Maximum Number of Balls in a Box/Solution.rs diff --git a/solution/1700-1799/1742.Maximum Number of Balls in a Box/README.md b/solution/1700-1799/1742.Maximum Number of Balls in a Box/README.md index 201650a5221bf..fdbf53dd7d59c 100644 --- a/solution/1700-1799/1742.Maximum Number of Balls in a Box/README.md +++ b/solution/1700-1799/1742.Maximum Number of Balls in a Box/README.md @@ -76,11 +76,11 @@ tags: ### 方法一：数组 + 模拟 -观察题目的数据范围，小球的编号最大不超过 $10^5$，那么每个编号的各个位数之和的最大值小于 $50$。因此，我们可以直接开一个长度为 $50$ 的数组 $cnt$ 来统计每个编号的各个位数之和的数量。 +观察题目的数据范围，小球的编号最大不超过 $10^5$，那么每个编号的各个位数之和的最大值小于 $50$。因此，我们可以直接开一个长度为 $50$ 的数组 $\textit{cnt}$ 来统计每个编号的各个位数之和的数量。 -答案就是数组 $cnt$ 中的最大值。 +答案就是数组 $\textit{cnt}$ 中的最大值。 -时间复杂度 $O(n \times \log_{10}m)$。其中 $n = highLimit - lowLimit + 1$，而 $m = highLimit$。 +时间复杂度 $O(n \times \log_{10}m)$。其中 $n = \textit{highLimit} - \textit{lowLimit} + 1$，而 $m = \textit{highLimit}$。 @@ -172,6 +172,67 @@ function countBalls(lowLimit: number, highLimit: number): number { } ``` +#### Rust + +```rust +impl Solution { + pub fn count_balls(low_limit: i32, high_limit: i32) -> i32 { + let mut cnt = vec![0; 50]; + for x in low_limit..=high_limit { + let mut y = 0; + let mut n = x; + while n > 0 { + y += n % 10; + n /= 10; + } + cnt[y as usize] += 1; + } + *cnt.iter().max().unwrap() + } +} +``` + +#### JavaScript + +```js +/** + * @param {number} lowLimit + * @param {number} highLimit + * @return {number} + */ +var countBalls = function (lowLimit, highLimit) { + const cnt = Array(50).fill(0); + for (let i = lowLimit; i <= highLimit; ++i) { + let y = 0; + for (let x = i; x; x = Math.floor(x / 10)) { + y += x % 10; + } + ++cnt[y]; + } + return Math.max(...cnt); +}; +``` + +#### C# + +```cs +public class Solution { + public int CountBalls(int lowLimit, int highLimit) { + int[] cnt = new int[50]; + for (int x = lowLimit; x <= highLimit; x++) { + int y = 0; + int n = x; + while (n > 0) { + y += n % 10; + n /= 10; + } + cnt[y]++; + } + return cnt.Max(); + } +} +``` + diff --git a/solution/1700-1799/1742.Maximum Number of Balls in a Box/README_EN.md b/solution/1700-1799/1742.Maximum Number of Balls in a Box/README_EN.md index f76f6e7f9877a..519ee846cc15e 100644 --- a/solution/1700-1799/1742.Maximum Number of Balls in a Box/README_EN.md +++ b/solution/1700-1799/1742.Maximum Number of Balls in a Box/README_EN.md @@ -74,11 +74,11 @@ Box 10 has the most number of balls with 2 balls. ### Solution 1: Array + Simulation -Observing the data range of the problem, the maximum number of the ball does not exceed $10^5$, so the maximum value of the sum of each digit of the number is less than $50$. Therefore, we can directly create an array $cnt$ with a length of $50$ to count the number of each digit sum of each number. +Observing the problem's data range, the maximum number of balls does not exceed $10^5$, so the maximum sum of the digits of each number is less than $50$. Therefore, we can directly create an array $\textit{cnt}$ of length $50$ to count the number of occurrences of each digit sum. -The answer is the maximum value in the array $cnt$. +The answer is the maximum value in the array $\textit{cnt}$. -The time complexity is $O(n \times \log_{10}m)$. Here, $n = highLimit - lowLimit + 1$, and $m = highLimit$. +The time complexity is $O(n \times \log_{10}m)$. Here, $n = \textit{highLimit} - \textit{lowLimit} + 1$, and $m = \textit{highLimit}$. @@ -170,6 +170,67 @@ function countBalls(lowLimit: number, highLimit: number): number { } ``` +#### Rust + +```rust +impl Solution { + pub fn count_balls(low_limit: i32, high_limit: i32) -> i32 { + let mut cnt = vec![0; 50]; + for x in low_limit..=high_limit { + let mut y = 0; + let mut n = x; + while n > 0 { + y += n % 10; + n /= 10; + } + cnt[y as usize] += 1; + } + *cnt.iter().max().unwrap() + } +} +``` + +#### JavaScript + +```js +/** + * @param {number} lowLimit + * @param {number} highLimit + * @return {number} + */ +var countBalls = function (lowLimit, highLimit) { + const cnt = Array(50).fill(0); + for (let i = lowLimit; i <= highLimit; ++i) { + let y = 0; + for (let x = i; x; x = Math.floor(x / 10)) { + y += x % 10; + } + ++cnt[y]; + } + return Math.max(...cnt); +}; +``` + +#### C# + +```cs +public class Solution { + public int CountBalls(int lowLimit, int highLimit) { + int[] cnt = new int[50]; + for (int x = lowLimit; x <= highLimit; x++) { + int y = 0; + int n = x; + while (n > 0) { + y += n % 10; + n /= 10; + } + cnt[y]++; + } + return cnt.Max(); + } +} +``` + diff --git a/solution/1700-1799/1742.Maximum Number of Balls in a Box/Solution.cs b/solution/1700-1799/1742.Maximum Number of Balls in a Box/Solution.cs new file mode 100644 index 0000000000000..70de08a91ab94 --- /dev/null +++ b/solution/1700-1799/1742.Maximum Number of Balls in a Box/Solution.cs @@ -0,0 +1,15 @@ +public class Solution { + public int CountBalls(int lowLimit, int highLimit) { + int[] cnt = new int[50]; + for (int x = lowLimit; x <= highLimit; x++) { + int y = 0; + int n = x; + while (n > 0) { + y += n % 10; + n /= 10; + } + cnt[y]++; + } + return cnt.Max(); + } +} diff --git a/solution/1700-1799/1742.Maximum Number of Balls in a Box/Solution.js b/solution/1700-1799/1742.Maximum Number of Balls in a Box/Solution.js new file mode 100644 index 0000000000000..53c0f0670b57e --- /dev/null +++ b/solution/1700-1799/1742.Maximum Number of Balls in a Box/Solution.js @@ -0,0 +1,16 @@ +/** + * @param {number} lowLimit + * @param {number} highLimit + * @return {number} + */ +var countBalls = function (lowLimit, highLimit) { + const cnt = Array(50).fill(0); + for (let i = lowLimit; i <= highLimit; ++i) { + let y = 0; + for (let x = i; x; x = Math.floor(x / 10)) { + y += x % 10; + } + ++cnt[y]; + } + return Math.max(...cnt); +}; diff --git a/solution/1700-1799/1742.Maximum Number of Balls in a Box/Solution.rs b/solution/1700-1799/1742.Maximum Number of Balls in a Box/Solution.rs new file mode 100644 index 0000000000000..8d0cd508c82ac --- /dev/null +++ b/solution/1700-1799/1742.Maximum Number of Balls in a Box/Solution.rs @@ -0,0 +1,15 @@ +impl Solution { + pub fn count_balls(low_limit: i32, high_limit: i32) -> i32 { + let mut cnt = vec![0; 50]; + for x in low_limit..=high_limit { + let mut y = 0; + let mut n = x; + while n > 0 { + y += n % 10; + n /= 10; + } + cnt[y as usize] += 1; + } + *cnt.iter().max().unwrap() + } +}