LeetCode-728. Self Dividing Numbers

LeetCode-728. Self Dividing Numbers

A self-dividing number is a number that is divisible by every digit it contains.

For example, 128 is a self-dividing number because ​​128 % 1 == 0​​​, ​​128 % 2 == 0​​​, and ​​128 % 8 == 0​​.

Also, a self-dividing number is not allowed to contain the digit zero.

Given a lower and upper number bound, output a list of every possible self dividing number, including the bounds if possible.

Example 1:

Input: left = 1, right = 22Output: [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]

Note:

The boundaries of each input argument are​​1 <= left <= right <= 10000​​.

题解：注意除0异常。

class Solution {public: vector selfDividingNumbers(int left, int right) { vector v; for (int i = left; i <= right; i++) { if (i < 10) { v.push_back(i); } else if (judgeSDN(i) == true) { v.push_back(i); } } return v; } bool judgeSDN (int n) { int total = n; bool ans = true; while (n > 0) { int idx = n % 10; n /= 10; if (idx == 0 || (idx != 0 && total % idx != 0)) { ans = false; break; } } return ans; }};

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。