A\u00a0self-dividing number<\/i>\u00a0is a number that is divisible by every digit it contains.<\/p>\n
For example, 128 is a self-dividing number because\u00a0 Also, a self-dividing number is not allowed to contain the digit zero.<\/p>\n Given a lower and upper number bound, output a list of every possible self dividing number, including the bounds if possible.<\/p>\n Example 1:<\/b><\/p>\n Note:<\/b><\/p>\n <\/p>\n <\/p>\n Python<\/strong><\/p>\n128 % 1 == 0<\/code>,\u00a0128 % 2 == 0<\/code>, and\u00a0128 % 8 == 0<\/code>.<\/p>\nInput:<\/b> \r\nleft = 1, right = 22\r\nOutput:<\/b> [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]\r\n<\/pre>\n
\n
1 <= left <= right <= 10000<\/code>.<\/li>\n<\/ul>\n \r\nclass Solution(object):\r\n def selfDividingNumbers(self, left, right):\r\n """\r\n :type left: int\r\n :type right: int\r\n :rtype: List[int]\r\n """\r\n a = []\r\n for i in range(left, right + 1):\r\n if self.isDN(i):\r\n a.append(i)\r\n return a\r\n \r\n \r\n def isDN(self, num):\r\n if str(0) in str(num):\r\n return False\r\n for i in str(num):\r\n if num % int(i) != 0:\r\n return False\r\n return True\r\n \r\n \r\n \r\n \r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"