C#版(击败96.64%的提交) - Leetcode 728. 自除数 - 题解

输入： 
上边界left = 1, 下边界right = 22
输出： [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]

public class Solution
{
    public IList<int> SelfDividingNumbers(int left, int right)
    {
        List<int> list = new List<int>();
        for (int i = left; i <= right; ++i)
        {
            if (isSelfDiv(i))
                list.Add(i);
        }
        return list;
    }

    bool isSelfDiv(int n)
    {
        if (n < 10)
            return true;
        if (n % 10 == 0)
            return false;

        int t = n;
        while (t != 0)         // 此while循环的出口条件需要好好体会
        {
            int rem = t % 10;
            if (rem == 0)
                return false;
            if (rem >1 && n % rem != 0)
                return false;
            t /= 10;
        }
        return true;
    }
}