• 《剑指offer》第四十六题(把数字翻译成字符串)


    // 面试题46:把数字翻译成字符串
    // 题目:给定一个数字,我们按照如下规则把它翻译为字符串:0翻译成"a",1翻
    // 译成"b",……,11翻译成"l",……,25翻译成"z"。一个数字可能有多个翻译。例
    // 如12258有5种不同的翻译,它们分别是"bccfi"、"bwfi"、"bczi"、"mcfi"和
    // "mzi"。请编程实现一个函数用来计算一个数字有多少种不同的翻译方法。
    
    #include <string>
    #include <iostream>
    
    using namespace std;
    
    int GetTranslationCount(const string& number);
    
    int GetTranslationCount(int number)
    {
        if (number < 0)
            return 0;
    
        string numberInString = to_string(number);//转换成字符串
        return GetTranslationCount(numberInString);
    }
    
    int GetTranslationCount(const string& number)
    {
        int length = number.length();
        int* counts = new int[length];
        int count = 0;
    
        for (int i = length - 1; i >= 0; --i)//从右开始计算,避免递归中碰到重复的子问题
        {
            count = 0;
            if (i < length - 1)
                count = counts[i + 1];
            else
                count = 1;
    
            if (i < length - 1)
            {
                int digit1 = number[i] - '0';
                int digit2 = number[i + 1] - '0';
                int converted = digit1 * 10 + digit2;
                if (converted >= 10 && converted <= 25)//满足条件,记录当前位置所有可能的次数
                {
                    if (i < length - 2)//有点动态规划的意思
                        count += counts[i + 2];
                    else
                        count += 1;
                }
            }
    
            counts[i] = count;
        }
    
        count = counts[0];//返回counts第一个值
        delete[] counts;
    
        return count;
    }
    
    // ====================测试代码====================
    void Test(const string& testName, int number, int expected)
    {
        if (GetTranslationCount(number) == expected)
            cout << testName << " passed." << endl;
        else
            cout << testName << " FAILED." << endl;
    }
    
    void Test1()
    {
        int number = 0;
        int expected = 1;
        Test("Test1", number, expected);
    }
    
    void Test2()
    {
        int number = 10;
        int expected = 2;
        Test("Test2", number, expected);
    }
    
    void Test3()
    {
        int number = 125;
        int expected = 3;
        Test("Test3", number, expected);
    }
    
    void Test4()
    {
        int number = 126;
        int expected = 2;
        Test("Test4", number, expected);
    }
    
    void Test5()
    {
        int number = 426;
        int expected = 1;
        Test("Test5", number, expected);
    }
    
    void Test6()
    {
        int number = 100;
        int expected = 2;
        Test("Test6", number, expected);
    }
    
    void Test7()
    {
        int number = 101;
        int expected = 2;
        Test("Test7", number, expected);
    }
    
    void Test8()
    {
        int number = 12258;
        int expected = 5;
        Test("Test8", number, expected);
    }
    
    void Test9()
    {
        int number = -100;
        int expected = 0;
        Test("Test9", number, expected);
    }
    
    int main(int argc, char* argv[])
    {
        Test1();
        Test2();
        Test3();
        Test4();
        Test5();
        Test6();
        Test7();
        Test8();
        Test9();
        system("pause");
        return 0;
    }
  • 相关阅读:
    bzoj1951 [Sdoi2010]古代猪文
    bzoj2693 jzptab
    数学一本通第三章总结
    poj1019 Number Sequence
    SGU179 Brackets light
    字母组合2
    字母组合
    Java基础知识强化之集合框架笔记09:Collection集合迭代器使用的问题探讨
    Java基础知识强化之集合框架笔记08:Collection集合自定义对象并遍历案例(使用迭代器)
    Java基础知识强化之集合框架笔记07:Collection集合的遍历之迭代器遍历
  • 原文地址:https://www.cnblogs.com/CJT-blog/p/10524144.html
Copyright © 2020-2023  润新知