<p>An integer <code>x</code> is a <strong>good</strong> if after rotating each digit individually by 180 degrees, we get a valid number that is different from <code>x</code>. Each digit must be rotated - we cannot choose to leave it alone.</p>

<p>A number is valid if each digit remains a digit after rotation. For example:</p>

<ul>
	<li><code>0</code>, <code>1</code>, and <code>8</code> rotate to themselves,</li>
	<li><code>2</code> and <code>5</code> rotate to each other (in this case they are rotated in a different direction, in other words, <code>2</code> or <code>5</code> gets mirrored),</li>
	<li><code>6</code> and <code>9</code> rotate to each other, and</li>
	<li>the rest of the numbers do not rotate to any other number and become invalid.</li>
</ul>

<p>Given an integer <code>n</code>, return <em>the number of <strong>good</strong> integers in the range </em><code>[1, n]</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> n = 10
<strong>Output:</strong> 4
<strong>Explanation:</strong> 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.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> n = 1
<strong>Output:</strong> 0
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> n = 2
<strong>Output:</strong> 1
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= n &lt;= 10<sup>4</sup></code></li>
</ul>

class Solution {
public:
    int rotate(int d){
        if(d==1||d==0||d==8)return d;
        else if(d==2)return 5;
        else if(d==5)return 2;
        else if(d==6)return 9;
        else if(d==9)return 6;
        else return -1;
    }
    bool isgood(int x){
        int temp=x;
        vector<int>digits;
        
        while(x>0){
         int d=x%10;
         x=x/10;
         if(rotate(d)!=-1){
           digits.push_back(rotate(d));
         }
         else{
            return false;
         }

        }
        int num1=0;
        for(int i=digits.size()-1;i>=0;i--){
            num1=num1*10+digits[i];
        }
        return temp!=num1;
    }
    int rotatedDigits(int n) {
   
    vector<int>dp(n+1,0);
    dp[0]=0;

    for(int i=1;i<n+1;i++){
     if(isgood(i)){
        dp[i]=dp[i-1]+1;

     }
     else dp[i]=dp[i-1];
    }
    return dp[n];
    }
};
18200