[{"createTime":1735734952000,"id":1,"img":"hwy_ms_500_252.jpeg","link":"https://activity.huaweicloud.com/cps.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=V1g3MDY4NTY=&utm_medium=cps&utm_campaign=201905","name":"华为云秒杀","status":9,"txt":"华为云38元秒杀","type":1,"updateTime":1735747411000,"userId":3},{"createTime":1736173885000,"id":2,"img":"txy_480_300.png","link":"https://cloud.tencent.com/act/cps/redirect?redirect=1077&cps_key=edb15096bfff75effaaa8c8bb66138bd&from=console","name":"腾讯云秒杀","status":9,"txt":"腾讯云限量秒杀","type":1,"updateTime":1736173885000,"userId":3},{"createTime":1736177492000,"id":3,"img":"aly_251_140.png","link":"https://www.aliyun.com/minisite/goods?userCode=pwp8kmv3","memo":"","name":"阿里云","status":9,"txt":"阿里云2折起","type":1,"updateTime":1736177492000,"userId":3},{"createTime":1735660800000,"id":4,"img":"vultr_560_300.png","link":"https://www.vultr.com/?ref=9603742-8H","name":"Vultr","status":9,"txt":"Vultr送$100","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":5,"img":"jdy_663_320.jpg","link":"https://3.cn/2ay1-e5t","name":"京东云","status":9,"txt":"京东云特惠专区","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":6,"img":"new_ads.png","link":"https://www.iodraw.com/ads","name":"发布广告","status":9,"txt":"发布广告","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":7,"img":"yun_910_50.png","link":"https://activity.huaweicloud.com/discount_area_v5/index.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=aXhpYW95YW5nOA===&utm_medium=cps&utm_campaign=201905","name":"底部","status":9,"txt":"高性能云服务器2折起","type":2,"updateTime":1735660800000,"userId":3}]
回文数
概述：给你一个整数 x ，如果 x 是一个回文整数，返回 true ；否则，返回 false 。
回文数是指正序（从左向右）和倒序（从右向左）读都是一样的整数。
输入：x = 121 输出：true 输入：x = -121 输出：false 输入：x = 10 输出：false
方法一：暴力循环
最简单暴力的办法就是，先将整数转字符串，然后通过循环检索来判断该整数是否为回文数。
# 暴力循环 class Solution: def isPalindrome(self, x: int) -> bool: if x < 0:
return False str_x = str(x) n = len(str_x) for i in range(int(n/2)): #
长度折半需取整，则可排除奇偶问题 if str_x[i] != str_x[-i-1]: # 检索从0开始，逆序检索需-1 return False
return True
方法二：检索反转
其次容易想到的是，字符串切片操作，通过字符串反转直接判断该该整数是否为回文数。
# 检索反转 class Solution: def isPalindrome(self, x: int) -> bool: if x < 0:
return False str_x = str(x) reverse_str_x = str_x[::-1] if str_x ==
reverse_str_x: return True else: return False
方法三：数学解法
比较复杂一些的算法是，通过取整和取余操作，来获取整数中对应的数字进行比较。
# 数学解法 class Solution: def isPalindrome(self, x: int) -> bool: if x < 0:
return False y = 0 x_check = x while x: y = y * 10 + x % 10 x //= 10 if y ==
x_check: return True else: return False
总结
你担心你的溢出，我用我的循环！
