leetcode 2396. Strictly Palindromic Number

https://leetcode.com/problems/strictly-palindromic-number/description/

Strictly Palindromic Number - LeetCode

 

def base_n(number, base):
    based_number = ''
    while number > 0:
        based_number += str(number % base)
        number //= base
    if based_number == based_number[::-1]:
        return True
    else:
        return False
 
 
class Solution:
    def isStrictlyPalindromic(self, n: int) -> bool:
        answer = True
        for base in range(2, n - 1):
            if not base_n(n, base):
                answer = False
                break
        return answer
 

진법 변환하는 함수를 만들고, 그 결과가 palindromic 한지 출력하는 문제입니다

It is a problem to create a function that converts base and outputs whether the result is palindromic.