Leetcode：728. Self Dividing Numbers（是否为分裂数字）

原创于 2017-11-29 11:39:37 发布 · 353 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #numbers

leetcode 同时被 2 个专栏收录

47 篇文章

订阅专栏

Leetcode

47 篇文章

订阅专栏

本文介绍了一种用于找出指定范围内所有自除数的算法。自除数是指可以被其每一位数字整除的数字，且不含0。文章通过示例解释了自除数的概念，并提供了一个Java实现方法，用于生成自除数列表。

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]

代码如下：

public static  List<Integer> selfDividingNumbers(int left, int right) {

         List<Integer> list = new ArrayList<Integer>();
         for (int i = left; i <= right; i++) {
            if(isDividNumber(i)==true)
                list.add(i);
        }
         return list;
    }
    public static Boolean isDividNumber(int num){
        int temp = num;//temp来计算末尾的数
        while(temp>0){
            int rail_num = temp%10;
            if (rail_num==0) {
                return false;
            }
            if(num % rail_num==0) {
                temp/=10;//如果%==0那么就temp/10
            }
            else return false;
        }
        return true;
    }