在这里,我们使用不同的python内置函数。首先,我们使用bin()
数字将其转换为二进制,然后反转字符串的二进制形式,然后与原始数字进行比较,如果匹配则回文,否则返回。
Input: 5 Output: palindrome
5的二进制表示形式是101
将其取反,结果为101,然后将其与原件进行比较。
所以它的回文
Palindromenumber(n) /* n is the number */ Step 1: input n Step 2: convert n into binary form. Step 3: skip the first two characters of a string. Step 4: them reverse the binary string and compare with originals. Step 5: if its match with originals then print Palindrome, otherwise not a palindrome.
# To check if binary representation of a number is pallindrome or not defpalindromenumber(n): # convert number into binary bn_number = bin(n) # skip first two characters of string # Because bin function appends '0b' as # prefix in binary #representation of a number bn_number = bn_number[2:] # now reverse binary string and compare it with original if(bn_number == bn_number[-1::-1]): print(n," IS A PALINDROME NUMBER") else: print(n, "IS NOT A PALINDROME NUMBER") # Driver program if __name__ == "__main__": n=int(input("Enter Number ::>")) palindromenumber(n)
输出结果
Enter Number ::>10 10 IS NOT A PALINDROME NUMBER Enter Number ::>9 9 IS A PALINDROME NUMBER