【Leetcode_easy】788. Rotated Digits

problem

788. Rotated Digits

solution1:

class Solution {
public:
    int rotatedDigits(int N) {
        int res = ;
        for(int i=; i<=N; ++i)
        {
            if(check(i)) res++;
        }
        return res;
    }
    bool check(int num)
    {
        string str = to_string(num);
        bool flag = false;
        for(auto ch:str)
        {
            if(ch==''||ch==''||ch=='') return false;
            if(ch==''||ch==''||ch==''||ch=='') flag = true;
        }
        return flag;
    }
};

参考

1. Leetcode_easy_788. Rotated Digits;

2. Grandyang;

完