{"id":9800,"date":"2022-09-07T22:11:22","date_gmt":"2022-09-08T05:11:22","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=9800"},"modified":"2022-09-07T22:11:35","modified_gmt":"2022-09-08T05:11:35","slug":"leetcode-2396-strictly-palindromic-number%ef%bf%bc%ef%bf%bc","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/math\/leetcode-2396-strictly-palindromic-number%ef%bf%bc%ef%bf%bc\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 2396.\u00a0Strictly Palindromic Number"},"content":{"rendered":"\n

An integer n<\/code> is strictly palindromic<\/strong> if, for every<\/strong> base b<\/code> between 2<\/code> and n - 2<\/code> (inclusive<\/strong>), the string representation of the integer n<\/code> in base b<\/code> is palindromic<\/strong>.<\/p>\n\n\n\n

Given an integer n<\/code>, return true<\/code> if <\/em>n<\/code> is strictly palindromic<\/strong> and <\/em>false<\/code> otherwise<\/em>.<\/p>\n\n\n\n

A string is palindromic<\/strong> if it reads the same forward and backward.<\/p>\n\n\n\n

Example 1:<\/strong><\/p>\n\n\n\n

Input:<\/strong> n = 9\nOutput:<\/strong> false\nExplanation:<\/strong> In base 2: 9 = 1001 (base 2), which is palindromic.\nIn base 3: 9 = 100 (base 3), which is not palindromic.\nTherefore, 9 is not strictly palindromic so we return false.\nNote that in bases 4, 5, 6, and 7, n = 9 is also not palindromic.\n<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> n = 4\nOutput:<\/strong> false\nExplanation:<\/strong> We only consider base 2: 4 = 100 (base 2), which is not palindromic.\nTherefore, we return false.\n<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n
  • 4 <= n <= 105<\/sup><\/code><\/li><\/ul>\n\n\n\n
    Solution: Just return false<\/strong><\/h2>\n\n\n\n
    No such number.<\/p>\n\n\n\n
    Time complexity: O(1)
    Space complexity: O(1)<\/p>\n\n\n\n
    \n
    C++<\/h2>\n
    \n\n
    \/\/ Author: Huahua\nclass Solution {\npublic:\n  bool isStrictlyPalindromic(int n) {\n    return false;\n  }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"
    An integer n is strictly palindromic if, for every base b between 2 and n – 2 (inclusive), the string representation of the integer n in base b is palindromic. Given an integer n, return true if n is strictly palindromic and false otherwise. A string is palindromic if it reads the same…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[49],"tags":[31,177,720],"class_list":["post-9800","post","type-post","status-publish","format-standard","hentry","category-math","tag-math","tag-medium","tag-proof","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/9800","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/comments?post=9800"}],"version-history":[{"count":2,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/9800\/revisions"}],"predecessor-version":[{"id":9802,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/9800\/revisions\/9802"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=9800"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=9800"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=9800"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}