class Solution {
public int rotatedDigits(int N) {
int ans = 0;
for (int i = 1;i <= N;i++) {//循环判断
if (judge(i)) {
ans++;
}
}
return ans;
}
public boolean judge(int num) {
String rule = “0182569”;
boolean ok = false;
while (num != 0) {
int m = num % 10;
if (rule.indexOf((char) (m + '0')) < 0) {//判断是否在这串数字中
return false;
}
if (m == 2 || m == 5 || m == 6 || m == 9) {//看是否至少存在一个转换后不等于自身的数字,因为比如101,旋转180°后依然是自己本身
ok = true;
}
num /= 10;
}
return ok;
}
}