一、题目
2520. Count the Digits That Divide a Number
Given an integer num, return the number of digits in num that divide num.
An integer val divides nums if nums % val == 0.
Example 1:
Input: num = 7
Output: 1
Explanation: 7 divides itself, hence the answer is 1.
Example 2:
Input: num = 121
Output: 2
Explanation: 121 is divisible by 1, but not 2. Since 1 occurs twice as a digit, we return 2.
Example 3:
Input: num = 1248
Output: 4
Explanation: 1248 is divisible by all of its digits, hence the answer is 4.
Constraints:文章来源：https://www.toymoban.com/news/detail-715942.html
1 <= num <= 109
num does not contain 0 as one of its digits.文章来源地址https://www.toymoban.com/news/detail-715942.html
二、题解
class Solution {
public:
int countDigits(int num) {
int tmp = num;
int res = 0;
while(tmp){
int mod = tmp % 10;
if(num % mod == 0) res++;
tmp = tmp / 10;
}
return res;
}
};
到了这里，关于LeetCode每日一题——2520. Count the Digits That Divide a Number的文章就介绍完了。如果您还想了解更多内容，请在右上角搜索TOY模板网以前的文章或继续浏览下面的相关文章，希望大家以后多多支持TOY模板网！
