Leetcode——788. Rotated Digits

题目原址

https://leetcode.com/problems/rotated-digits/description/

题目描述

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. 传递进来的N是集合的范围，范围：[1,N]
2. 返回集合中有多少个符合以下条件数
   （1）如果该数包含2，5，6，9中的一个数，而不包含3，4，7中的任意一个数，就算符合条件

AC代码

class Solution {
    public int rotatedDigits(int N) {
        int count = 0;
        for(int i = 1; i <= N; i++ ) {
            if(isValid(i)) 
                count++;
        }
        return count;
    }

    public boolean isValid(int i) {
        boolean valid = false;

        while(i > 0) {
            if(i % 10 == 2 || i % 10 == 5 || i % 10 == 6 || i % 10 == 9)
                valid = true;
            if(i% 10 == 3 || i% 10 == 4 || i% 10 == 7)
                return false;
            i = i / 10;
        }
        return valid;
    }
}

感谢

https://leetcode.com/problems/rotated-digits/discuss/116547/Easily-Understood-Java-Solution