[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 = 22
Output: [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.

  思路：

  没有算法，一个一个试就可以了。。。

  代码：

  class Solution {
  public:
      vector<int> selfDividingNumbers(int left, int right) {
          vector<int> ans;
          for (int i = left; i <= right; ++i) {
              if (isSelfDividingNumber(i)) {
                  ans.push_back(i);
              }
          }
          return ans;
      }
  private:
      bool isSelfDividingNumber(int num) {
          int remain = 0, temp_num = num;
          while (temp_num != 0) {
              remain = temp_num % 10;
              if (remain == 0 || num % remain != 0) {
                  return false;
              }
              temp_num /= 10;
          }
          return true;
      }
  };