数据结构与算法：leetcode_728_Self Dividing Numbers

• Description
  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
  Input:
  left = 1, right = 22
  Output: [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]
  The boundaries of each input argument are 1 <= left <= right <= 10000

• Solution

    public List<Integer> selfDividingNumbers(int left, int right) {
        List<Integer> list = new ArrayList<>();
        int slength;
        for (int i = left; i <= right; i++) {
            slength = 0;
            String is = Integer.toString(i);
            for (int j = 0; j < is.length(); j++) {
                if (Integer.parseInt(is.substring(j, j + 1)) == 0) {
                    break;
                }
                if (i % (Integer.parseInt(is.substring(j, j + 1))) == 0) {
                    slength++;
                }
            }
            if (is.length() == slength) {
                list.add(i);
            }
        }
        for (int k = 0; k < list.size(); k++) {
            System.out.println(list.get(k) + " ");
        }
        return list;
    }