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.

实现：

public List<Integer> selfDividingNumbers(int left, int right){
	List<Integer> list = new ArrayList<>();
	for(int i = left, i <= right; i++){
		int j = i;
		for(; j > 0; j /= 10{
			if((j % 10 == 0) || (i % (j % 10 ) != 0)) breal;
		}
		if(j == 0) list.add(i);
	}
	return list;
}

思路：
创建一个从left到right的数组，从头开始遍历，每个位置都判断该数字是否为self-dividing数字。