LeetCode #1088. Confusing Number II

题目描述：

We can rotate digits by 180 degrees to form new digits. When 0, 1, 6, 8, 9 are rotated 180 degrees, they become 0, 1, 9, 8, 6 respectively. When 2, 3, 4, 5 and 7 are rotated 180 degrees, they become invalid.

A confusing number is a number that when rotated 180 degrees becomes a different number with each digit valid.(Note that the rotated number can be greater than the original number.)

Given a positive integer N, return the number of confusing numbers between 1 and N inclusive.

Example 1:

Input: 20
Output: 6
Explanation: 
The confusing numbers are [6,9,10,16,18,19].
6 converts to 9.
9 converts to 6.
10 converts to 01 which is just 1.
16 converts to 91.
18 converts to 81.
19 converts to 61.

Example 2:

Input: 100
Output: 19
Explanation: 
The confusing numbers are [6,9,10,16,18,19,60,61,66,68,80,81,86,89,90,91,98,99,100].

Note:

1 <= N <= 10^9

class Solution {
public:int confusingNumberII(int N) {int count=0;search(0,N,count);return count;}// 旋转之后可能溢出，要用long long存储void search(long long cur, int N, int& count){if(cur>N) return;if(cur!=rotate(cur)) count++;if(cur>0) search(cur*10,N,count); // 必须大于零，否则无限循环search(cur*10+1,N,count);search(cur*10+6,N,count);search(cur*10+8,N,count);search(cur*10+9,N,count);}long long rotate(long long n){long long m=0;while(n>0) {int x=n%10;if(x==6) x=9;else if(x==9) x=6;m*=10;m+=x;n/=10;}return m;}
};

LeetCode #1088. Confusing Number II相关推荐

【异或】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 137. Single Number II JAVA语言
1 2 3 Given an array of integers, every element appears three times except for one, which appears ex ...
Leetcode #137 Single Number II
题目链接:https://leetcode.com/problems/single-number-ii/ 题意表明有一个数字出现了一次,其他数字出现了三次,那么实现一个模3的计数器即可. 1 clas ...
LeetCode 137.Single Number II 只出现一次的数字 II
题目描述给定一个非空整数数组,除了某个元素只出现一次以外,其余每个元素均出现了三次.找出那个只出现了一次的元素. 说明: 你的算法应该具有线性时间复杂度. 你可以不使用额外空间来实现吗? 示例 1: ...
LEETCODE 137.Singel Number ii
Given an array of integers, every element appears three times except for one. Find that single one. ...
[LeetCode]Single Number II
今天室友推荐了一道LeetCode上面的练习题Single Number II,题目大概的意思是有一个整形的数组,里面只有一个数是出现一次的,其他的数都出现了三次,然后让把这个数找出来. 第一眼看到这 ...
LeetCode 1088. 易混淆数 II（回溯/BFS）
文章目录 1. 题目 2. 解题 2.1 回溯 2.2 BFS 1. 题目本题我们会将数字旋转 180° 来生成一个新的数字. 比如 0.1.6.8.9 旋转 180° 以后,我们得到的新数字分别为 ...
LeetCode 264. Ugly Number II--C++,Python解法
题目地址:Ugly Number II - LeetCode Write a program to find the n-th ugly number. Ugly numbers are positi ...
LeetCode 137. Single Number II--三次异或消除相同的数--C++,Python解法
题目地址:Single Number II - LeetCode Given a non-empty array of integers, every element appears three ti ...

LeetCode #1088. Confusing Number II

LeetCode #1088. Confusing Number II相关推荐

最新文章

热门文章