LeetCode题解之Rotated Digits

1、题目描述

2、代码

 int rotatedDigits(int N) {
         int res = ;

         for (int i = ; i <= N; i++) {
             if (isGood(i)) {
                 res++;
             }
         }

         return res;
     }

     bool isGood(int x)
     {
         int rx = x;
         vector<int> nums;
         while (x) {
             int r = x % ;
             nums.push_back(r);
             x = x / ;
         }    

         for (vector<int>::iterator it = nums.begin(); it != nums.end(); it++ ) {
             if (*it ==  || *it ==  || *it == )
                 return false;
             if (*it ==  || *it ==  || *it == )
                 continue;

             if (*it == ) {
                 *it = ;
                 continue;
             }

             if (*it == ) {
                 *it = ;
                 continue;
             }

             if (*it == ) {
                 *it = ;
                 continue;
             }

             if (*it == ) {
                 *it = ;
                 continue;
             }
         }

         int good  = ;
         for (vector<int>::reverse_iterator ite = nums.rbegin(); ite != nums.rend(); ite++) {
             good = good *   + *ite;
         }

         return good != rx;
     }