[leetcode] 788. 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].

代码：

#include<stack>
class Solution {
public:
    bool check(int num){
        stack<int> s;
        int newnum = 0;
        int n = num;
        while(num){
            int temp = num % 10;
            num /= 10;
                switch(temp){
                    case 2 : s.push(5); break;
                    case 5 : s.push(2); break;
                    case 6 : s.push(9);break;
                    case 9 : s.push(6);break;
                    case 0 : s.push(0);break;
                    case 8 : s.push(8);break;
                    case 1 : s.push(1);break;
                    default : return false;
                }
            }
        while(s.size()){
            newnum = newnum*10+s.top();
            s.pop();
        }
        if(n == newnum) return false;
        else return true;
    }
    
    int rotatedDigits(int N) {
        int cnt = 0;
        for(int i = 1; i <= N; i++){
            if(check(i)) cnt++;
        }
        return cnt;
    }
};

代码：

class Solution:
    def rotatedDigits(self, N):
        """
        :type N: int
        :rtype: int
        """
        l = [1, 1, 2, 0, 0, 2, 2, 0, 1, 2]
        cnt = 0
        for i in range(1, N+1):
            s = 1
            num = i
            while num:
                temp = num % 10
                num //= 10
                s *= l[temp]
            if s >= 2:
                cnt += 1
        
        return cnt