LeetCode:Confusing Number II

暴力搜索：

#include<bits/stdc++.h>using namespace std;void printVec1(vector<int>& v);
void printVec2(vector<vector<int>>& v);class Solution {
bool doit(long long num,int T,long long n){if(num > n) return false;int t = 0;long long s = num;while(s>0){t++;s/=10;}if(t!=T) return false;s = num;long long r = 0;while(s>0){r*=10;int d = s%10;if(d==6) r+=9;else if(d==9) r+=6;else r+=d;s/=10;}if(num==r) return false;return true;
};
void dfs(int t,int T,long long num,int& ans,long long n){if(t > 0){if(doit(num,t,n)) ans++;}if(t == T) return ;int bits[] = {0,1,6,8,9};for(int i=0;i<5;i++){num*=10;num+=bits[i];dfs(t+1,T,num,ans,n);num/=10;}
};
public:int confusingNumberII(int N) {int ans = 0;long long num = 0;int n = N;int t = 0;while(n>0){n/=10;t++;}dfs(0,t,num,ans,N);return ans;}
};int main(){Solution myS;int ans = myS.confusingNumberII(195);cout<<ans<<endl;return 0;
}// 输出一维数组
void printVec1(vector<int>& v){printf("{");if(v.size()!=0) printf("%d",v[0]);for(int i=1;i<v.size();i++){printf(",%d",v[i]);}printf("}");
}// 输出二维数组
void printVec2(vector<vector<int>>& v){printf("{");if(v.size()!=0) printVec1(v[0]);for(int i=1;i<v.size();i++){printf(",");printVec1(v[i]);}printf("}");
}

LeetCode:Confusing Number II相关推荐

[LeetCode]Single Number II
今天室友推荐了一道LeetCode上面的练习题Single Number II,题目大概的意思是有一个整形的数组,里面只有一个数是出现一次的,其他的数都出现了三次,然后让把这个数找出来. 第一眼看到这 ...
LeetCode Single Number II(位操作)
问题:给出一个数组,其中只有一个数出现一次,其它数出现三次,找出出现一次的数思路: 1.统计每位出现的次数,如果mod 3等于1,则将该位置为1,最后即得到出现一次的数. 2.使用三个变量来分别来表 ...
[Leetcode] single number ii 找单个数
Given an array of integers, every element appears three times except for one. Find that single one. ...
LeetCode Ugly Number II(丑数的计算)
代码如下: public class Solution {public int nthUglyNumber(int n) {int[] primes = {2, 3, 5};int[] idx = n ...
LeetCode | Single Number II
Given an array of integers, every element appears three times except for one. Find that single one. ...
[leetcode] Ugly Number II
public class Solution { public int nthUglyNumber(int n) { int[] ugly=new int[n+10]; ...
LeetCode Single Number I / II / III
[1]LeetCode 136 Single Number 题意:奇数个数,其中除了一个数只出现一次外,其他数都是成对出现,比如1,2,2,3,3...,求出该单个数. 解法:容易想到异或的性质,两个 ...
【异或】LeetCode 137. Single Number II
LeetCode 137. Single Number II Solution1:不会做,抄的博客转载自:http://www.cnblogs.com/grandyang/p/4263927.htm ...
leetcode 264. Ugly Number II
传送门 264. Ugly Number II QuestionEditorial Solution My Submissions Total Accepted: 36259 Total Submis ...
LeetCode 191 Number of 1 Bits
LeetCode 191 Number of 1 Bits 解法一(较为传统都解法):使用将n不断右移,并与1想&得到1的个数:(也有使用除法/2的,明显除法的运行效率要低于位移) 时间复杂度 ...

LeetCode:Confusing Number II

LeetCode:Confusing Number II相关推荐

最新文章

热门文章