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

思路：这题可以用hashmap的方法一个一个判断, Time (N*length of digit);

class Solution {
    public int rotatedDigits(int N) {
        if(N < 0) {
            return 0;
        }
        
        HashMap<Character, Character> hashmap = new HashMap<Character, Character>();
        hashmap.put('0','0');
        hashmap.put('1','1');
        hashmap.put('8','8');
        hashmap.put('2','5');
        hashmap.put('5','2');
        hashmap.put('6','9');
        hashmap.put('9','6');
 
        HashSet<Integer> set = new HashSet<Integer>();
        for(int i = 1; i <= N; i++) {
            String str = String.valueOf(i);
            int rotate = getrotate(str, hashmap);
            if(rotate != -1 && rotate != i) {
                set.add(i);
            }
        }
        return set.size();
    }
    
    private int getrotate(String str, HashMap<Character, Character> hashmap) {
        StringBuilder sb = new StringBuilder();
        for(int i = 0; i < str.length(); i++) {
            char c = str.charAt(i);
            if(!hashmap.containsKey(c)) {
                return -1;
            } else {
                sb.append(hashmap.get(c));
            }
        }
        return Integer.parseInt(sb.toString());
    }
}

更优化的方法是用dp，为什么可以用dp, 比如说,11, 你已经判断了，如果遇见112，你又要用头开始判断1，1，那样重复计算了，所以用dp来表示之前的计算结果，拿来直接用，减少计算，也就是O(n)就可以了；不用重复计算；dp的作用就是记录曾经计算的值，记录下来，并且分解子问题；

[i] = 0  代表invalid

dp[i] = 1 代表valid，重复

 dp[i] = 2, 代表valid，不重复，count++；

class Solution {
    public int rotatedDigits(int N) {
        if(N <= 0 ) return 0;
        int[] dp = new int[N+1];
        int count = 0;
        for(int i = 0; i <= N; i++) {
            if( i < 10) {
                if(i == 0 || i == 1 || i == 8) {
                    dp[i] = 1;
                } else if(i == 2 || i == 5 || i == 6 || i == 9) {
                    dp[i] = 2;
                    count++;
                }
            } else {
                int a = dp[i/10]; int b = dp[i%10];
                if(a == 1 && b == 1) {
                    dp[i] = 1;
                } else if(a >= 1 && b >= 1){
                    dp[i] = 2;
                    count++;
                }
            }
        }
        return count;
    }
}