一刷3099

Author: diguage

README.adoc

@@ -21719,12 +21719,12 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 //|Hard
 //|
 
-//|{counter:codes}
-//|{leetcode_base_url}/harshad-number/[3099. Harshad Number^]
-//|{source_base_url}/_3099_HarshadNumber.java[Java]
-//|{doc_base_url}/3099-harshad-number.adoc[题解]
-//|Easy
-//|
+|{counter:codes}
+|{leetcode_base_url}/harshad-number/[3099. Harshad Number^]
+|{source_base_url}/_3099_HarshadNumber.java[Java]
+|{doc_base_url}/3099-harshad-number.adoc[题解]
+|Easy
+|
 
 //|{counter:codes}
 //|{leetcode_base_url}/water-bottles-ii/[3100. Water Bottles II^]

docs/3099-harshad-number.adoc

@@ -1,42 +1,33 @@
 [#3099-harshad-number]
-= 3099. Harshad Number
+= 3099. 哈沙德数
 
-{leetcode}/problems/harshad-number/[LeetCode - 3099. Harshad Number ^]
+https://leetcode.cn/problems/harshad-number/[LeetCode - 3099. 哈沙德数 ^]
 
-An integer divisible by the *sum* of its digits is said to be a *Harshad* number. You are given an integer `x`. Return_ the sum of the digits _of_ _`x`_ _if_ _`x`_ _is a *Harshad* number, otherwise, return_ _`-1`_._
+如果一个整数能够被其各个数位上的数字之和整除，则称之为 *哈沙德数*（Harshad number）。给你一个整数 `x` 。如果 `x` 是 *哈沙德数* ，则返回 `x` 各个数位上的数字之和，否则，返回 `-1`。
 
- 
-*Example 1:*
+*示例 1：*
 
-<div class="example-block">
-*Input:* <span class="example-io">x = 18
+****
+*输入：* [.example-io]#x = 18#
 
-*Output:* <span class="example-io">9
+*输出：* [.example-io]#9#
 
-*Explanation:*
+*解释：* `x` 各个数位上的数字之和为 `9` 。`18` 能被 `9` 整除。因此 `18` 是哈沙德数，答案是 `9` 。
+****
 
-The sum of digits of `x` is `9`. `18` is divisible by `9`. So `18` is a Harshad number and the answer is `9`.
+*示例 2：*
 
+****
+*输入：* [.example-io]#x = 23#
 
-*Example 2:*
+*输出：* [.example-io]#-1#
 
-<div class="example-block">
-*Input:* <span class="example-io">x = 23
-
-*Output:* <span class="example-io">-1
-
-*Explanation:*
-
-The sum of digits of `x` is `5`. `23` is not divisible by `5`. So `23` is not a Harshad number and the answer is `-1`.
-
-
- 
-*Constraints:*
-
-
-* `1 <= x <= 100`
+*解释：* `x` 各个数位上的数字之和为 `5` 。`23` 不能被 `5` 整除。因此 `23` 不是哈沙德数，答案是 `+-1+` 。
+****
 
+*提示：*
 
+* `+1 <= x <= 100+`
 
 
 == 思路分析

docs/index.adoc

@@ -6282,7 +6282,7 @@ include::2850-minimum-moves-to-spread-stones-over-grid.adoc[leveloffset=+1]
 
 // include::3098-find-the-sum-of-subsequence-powers.adoc[leveloffset=+1]
 
-// include::3099-harshad-number.adoc[leveloffset=+1]
+include::3099-harshad-number.adoc[leveloffset=+1]
 
 // include::3100-water-bottles-ii.adoc[leveloffset=+1]
 

logbook/202503.adoc

@@ -623,6 +623,10 @@ endif::[]
 |{doc_base_url}/0794-valid-tic-tac-toe-state.adoc[题解]
 |✅ 总结提炼判断规则。
 
+|{counter:codes2503}
+|{leetcode_base_url}/harshad-number/[3099. 哈沙德数^]
+|{doc_base_url}/3099-harshad-number.adoc[题解]
+|✅ 数学计算
 
 |===
 

src/main/java/com/diguage/algo/leetcode/_3099_HarshadNumber.java

@@ -0,0 +1,19 @@
+package com.diguage.algo.leetcode;
+
+public class _3099_HarshadNumber {
+  // tag::answer[]
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2025-05-08 16:47:40
+   */
+  public int sumOfTheDigitsOfHarshadNumber(int x) {
+    int sum = 0;
+    int num = x;
+    while (num > 0) {
+      sum += num % 10;
+      num /= 10;
+    }
+    return x % sum == 0 ? sum : -1;
+  }
+  // end::answer[]
+}