leetcode728: 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.

  直接按照要求写就行了

  	public List<Integer> selfDividingNumbers(int left, int right) {
  		List<Integer> list = new ArrayList<Integer>();
  		for (int i = left; i <= right; i++) {
  			int curr = i;
  			boolean f = true;
  			while (curr != 0) {
  				int r = curr % 10;
  				if (r == 0 || i % r != 0)
  					f = false;
  				curr = curr / 10;
  			}
  			if (f == true)
  				list.add(i);
  		}
  		return list;
  	}