【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.

解决方法

复杂度为O(mn)，m=right -left，n是for循环里面循环次数。

class Solution {    public static List<Integer> selfDividingNumbers(int left, int right) {        List<Integer> L = new ArrayList<>();        int div = 0;        int rem = 0;        for(int i=left; i<=right; i++)        {            int tmp = i;            int tmp2 = i;            do{                rem = tmp2 % 10;                if(rem == 0)                    break;                if(tmp % rem != 0)                    break;                tmp2 /= 10;            }while(tmp2 != 0);            if(tmp2 == 0)//yes                L.add(tmp);        }        return L;    }}