788. Rotated Digits（python+cpp)

题目：

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].

解释：
good number->如果一个数字每一位旋转180°以后还是数字，而且不是它本身，那么它就是good number，比如0 旋转以后还是0 所以不是good number，2旋转以后是5，不是它本身，所以是good number。
3，4，7根本无法旋转，所以如果数字的某一位是这三个数字中的一个，则该数字不可能是good number。
除了上述情况外，如果数字里面存在2,5,6,9，则一定是 good number。
暴力一点的解法：
python代码：

class Solution(object):
    def rotatedDigits(self, N):
        """
        :type N: int
        :rtype: int
        """
        rotate_dict={'0':'0','1':'1','2':'5','5':'2','6':'9','8':'8','9':'6'}
        def isGood(num):
            string=str(num)
            result=''
            for s in string:
                if s not in rotate_dict:
                    return False
                else:
                    result+=''+rotate_dict[s]
            if int(result)!=num:
                return True
            return False
        res=0
        for i in xrange(1,N+1):
            if isGood(i):
                res+=1
        return res 

用了过滤法的解法更快一点

class Solution(object):
    def rotatedDigits(self, N):
        """
        :type N: int
        :rtype: int
        """
        result=0
        for num in range(1,N+1):
            str_num=str(num)
            if '3' in str_num or'4' in str_num or '7' in str_num:
                continue
            if '2' in str_num or '5' in str_num or '6' in str_num or'9' in str_num:
                result+=1
        return result

c++代码：

class Solution {
public:
    int rotatedDigits(int N) {
        int result=0;
        for (int i=1;i<=N;i++)
        {
            string str_num=to_string(i);
            if(count(str_num.begin(),str_num.end(),'3')||count(str_num.begin(),str_num.end(),'4') ||count(str_num.begin(),str_num.end(),'7'))
                continue;
            if(count(str_num.begin(),str_num.end(),'2')||count(str_num.begin(),str_num.end(),'5') ||count(str_num.begin(),str_num.end(),'6')||count(str_num.begin(),str_num.end(),'9'))
               result++;
        }
        return result;
    }
};

总结：
核心思想就是每一位每一位判断。