[LeetCode248]Strobogrammatic Number III

最新推荐文章于 2024-04-17 18:33:12 发布

SharonMoMo

最新推荐文章于 2024-04-17 18:33:12 发布

阅读量781

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/u012175043/article/details/50008537

LeetCode 专栏收录该内容

57 篇文章

订阅专栏

本文介绍了一种算法，用于计算在给定范围内存在的倒转数总数。倒转数是指当旋转180度后看起来相同的数字。文章提供了一个C++实现方案，通过回溯法生成指定范围内的所有可能倒转数，并计数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

A strobogrammatic number is a number that looks the same when rotated 180 degrees (looked at upside down).

Write a function to count the total strobogrammatic numbers that exist in the range of low <= num <= high.

For example,
Given low = "50", high = "100", return 3. Because 69, 88, and 96 are three strobogrammatic numbers.

Note:
Because the range might be a large number, the low and high numbers are represented as string.

Hide Tags Math Recursion
Hide Similar Problems (E) Strobogrammatic Number (M) Strobogrammatic Number II

这题比前两道更难一点，但有一点相似的是：还是从两头开始向中间处理。
Basic idea: generate all possible strobogrammatic numbers in between low and high by using backtracking, and count the total count.

class Solution {
public:
    int strobogrammaticInRange(string low, string high) {
        int cnt = 0, lowSize = low.size(), highSize = high.size();
        for(int i = lowSize; i <= highSize; ++i){
            string tmp(i,' ');
            helper(tmp, cnt, low, high, 0, i-1);
        }
        return cnt;
    }
private:
    unordered_map<char, char> mp ={{'0', '0'}, {'1', '1'}, {'6', '9'}, {'8', '8'}, {'9', '6'}};
    void helper(string tmp, int& cnt, string& low, string& high, int start, int end){
        if(start > end){
            if( (tmp[0] != '0' || tmp.size() == 1) &&isLess(low,tmp) && isLess(tmp,high)) ++cnt;
            return;
        }

        for(auto m : mp){
            tmp[start] = m.first;
            tmp[end] = m.second;
            if((start < end) || (start == end) && m.first == m.second)
                helper(tmp, cnt, low, high, start+1, end-1);
        }
    }
    bool isLess(string s, string t){
        if(s.size() != t.size() ) return s.size() < t.size();
        for(int i = 0; i< s.size(); ++i){
            if(s[i] < t[i]) return true;
            else if(s[i] > t[i]) return false;
        }
        return true;
    }
};