feat: add solutions to lc problem: No.3032

solution/3000-3099/3032.Count Numbers With Unique Digits II/README.md

@@ -300,19 +300,20 @@ public:
     bool isvalid(int n) {
         vector<bool> present(10, false);
         while (n) {
-        const int dig = n % 10;
-        if (present[dig])
-            return false;
-        present[dig] = true;
-        n /= 10;
+            const int dig = n % 10;
+            if (present[dig])
+                return false;
+            present[dig] = true;
+            n /= 10;
         }
         return true;
     }
     int numberCount(int a, int b) {
         int res = 0;
-        for (int i = a; i <= b; ++i)
-        if (isvalid(i)){
-            ++res;
+        for (int i = a; i <= b; ++i) {
+            if (isvalid(i)) {
+                ++res;
+            }
         }
         return res;
     }