【LeetCode】788.Rotated Digits

LeetCode 788

1. Rotated Digits

X is a good number if after rotating each digit individually by 180 degrees, we get a valid number that is different from X. Each digit must be rotated - we cannot choose to leave it alone.

A number is valid if each digit remains a digit after rotation. 0, 1, and 8 rotate to themselves; 2 and 5 rotate to each other; 6 and 9 rotate to each other, and the rest of the numbers do not rotate to any other number and become invalid.

Now given a positive number N, how many numbers X from 1 to N are good?

Example:
Input: 10
Output: 4
Explanation: 
There are four good numbers in the range [1, 10] : 2, 5, 6, 9.
Note that 1 and 10 are not good numbers, since they remain unchanged after rotating.

Note:

• N will be in range [1, 10000].

理解：这个题目就是找一个数字，满足下面三个条件：

1. 不能都是 0,1,8；
2. 至少包含 2,5,6,9 中的一个；
3. 不能含有 3,4,7；

思路：最简单的是遍历，代码如下：

#include <iostream>
using namespace std;
int rotatedDigits(int N);
int main()
{
    int N;
    cin>>N;
    int count = rotatedDigits(N);
    cout<<count<<endl;
    return 0;
}
bool isValid(int n)
{
    bool flag = false;
    while(n>0){
        switch(n%10){
            case 3: case 4: case 5: case 6: return false;
            case 1: case 0: case 8: break;
            default: flag = true;
        }
        n = n/10;
    }
    return flag;
}
int rotatedDigits(int N)
{
    int num = 0;
    for(int i =0;i<=N;i++)
    {
        num+=isValid(i) ? 1:0;
    }
    return num;
}