leetcode728

vector<int> selfDividingNumbers(int left, int right) {
    vector<int> V;
    for (int i = left; i <= right; i++)
    {
        //将数字分解
        int temp = i;
        if (i >=  && i <= )
        {
            V.push_back(i);
            continue;
        }
        bool tag = true;
        while (temp != )
        {
            int a = temp / ;
            int b = temp % ;

            if (b == )
            {
                tag = false;
                break;
            }
            if (i%b != )
            {
                tag = false;
                break;
            }

            temp = a;
        }
        if (tag)//此值可以自除
        {
            V.push_back(i);
        }
    }
    return V;
}