leetcode::find_the_closest_palindrome::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static string	nearestPalindromic (const string &n)

详细描述

在文件 leetcode.h 第 1433 行定义.

成员函数说明

nearestPalindromic()

string leetcode::find_the_closest_palindrome::Solution::nearestPalindromic ( const string &  n )

static

在文件 leetcode.cpp 第 3748 行定义.

                                                           {
            const long long num = stoll(n);
            if(num == 10 || num == 11) {
                return "9";
            }
            if(num < 10) {
                return to_string(num - 1);
            }
            int len         = n.length();
            const bool even = n.length() % 2 == 0;
            string prefix   = n.substr(0, n.length() / 2 + (even ? 0 : 1));
            string option_str[3];
            auto rev                      = string(prefix.rbegin() + (even ? 0 : 1), prefix.rend());
            option_str[2]                 = prefix + rev;
            const long long prefix_int[2] = {stoll(prefix) - 1, stoll(prefix) + 1};
            string prefix_str[2]          = {to_string(prefix_int[0]), to_string(prefix_int[1])};
            for(int i = 0; i < 2; i++) {
                if(prefix_str[i].length() == prefix.length()) {
                    rev           = string(prefix_str[i].rbegin() + (even ? 0 : 1), prefix_str[i].rend());
                    option_str[i] = prefix_str[i] + rev;
                } else if(prefix_str[i].length() > prefix.length()) {
                    rev           = string(prefix_str[i].rbegin() + (even ? 1 : 2), prefix_str[i].rend());
                    option_str[i] = prefix_str[i] + rev;
                } else if(prefix_str[i].length() < prefix.length()) {
                    rev           = string(prefix_str[i].rbegin(), prefix_str[i].rend());
                    option_str[i] = prefix_str[i] + (even ? "9" : "") + rev;
                }
            }
            long long option_int[3] = {stoll(option_str[0]), stoll(option_str[1]), stoll(option_str[2])};
            sort(option_int, option_int + 3);
            long long minimum = option_int[0];
            for(int i = 1; i < 3; i++) {
                if(abs(option_int[i] - num) < abs(minimum - num) && option_int[i] != num) {
                    minimum = option_int[i];
                }
            }
            return to_string(minimum);
        }

被这些函数引用 leetcode::find_the_closest_palindrome::TEST().

---

该类的文档由以下文件生成:

• leetcode.h
• leetcode.cpp