一、題目
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:文章來源：http://www.zghlxwxcb.cn/news/detail-715942.html
1 <= num <= 109
num does not contain 0 as one of its digits.文章來源地址http://www.zghlxwxcb.cn/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;
}
};
到了這里，關(guān)于LeetCode每日一題——2520. Count the Digits That Divide a Number的文章就介紹完了。如果您還想了解更多內(nèi)容，請(qǐng)?jiān)谟疑辖撬阉鱐OY模板網(wǎng)以前的文章或繼續(xù)瀏覽下面的相關(guān)文章，希望大家以后多多支持TOY模板網(wǎng)！
