728 Self Dividing Numbers.js

/**
 * 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.
 * 自除数 是指可以被它包含的每一位数除尽的数。
 * 例如，128 是一个自除数，因为 128 % 1 == 0，128 % 2 == 0，
 * 128 % 8 == 0。
 * 还有，自除数不允许包含 0 。
 * 给定上边界和下边界数字，输出一个列表，列表的元素是边界（含边界）内
 * 所有的自除数。
 */

/**
 * Example:
 * Input: left = 1, right = 22
 * Output: [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]
 */

/**
 * @param {number} left
 * @param {number} right
 * @return {number[]}
 */
const selfDividingNumbers = (left, right) => {
  const res = []

  for (let i = left; i <= right; i++) {
    const numArr = [...i.toString()]
    let mark = true
    numArr.forEach((num) => {
      if (num !== 0) {
        if (i % num !== 0) {
          mark = false
        }
      } else {
        mark = false
      }
    })
    if (mark) {
      res.push(i)
    }
  }

  return res
}

console.log(selfDividingNumbers(1, 22))