[{"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}]
加一
概述：给定一个由整数组成的非空数组所表示的非负整数，在该数的基础上加一。最高位数字存放在数组的首位， 数组中每个元素只存储单个数字。你可以假设除了整数 0
之外，这个整数不会以零开头。
输入：digits = [1,2,3] 输出：[1,2,4] 输入：digits = [4,3,2,1] 输出：[4,3,2,2] 输入：digits =
[0] 输出：[1]
方法一：逆序循环
思路：我们只需要对数组 digits 进行一次逆序遍历，找出第一个不为 99 的元素，将其加一并将后续所有元素置零即可。如果 digits 中所有的元素均为
99，我们需要返回一个新的数组。
话不多说，直接上代码！
# 逆序循环 class Solution: def plusOne(self, digits: List[int]) -> List[int]: n =
len(digits) for i in range(n-1, -1, -1): # 倒序，步长-1 if digits[i] == 9: digits[i]
= 0 else: digits[i] += 1 return digits # 无需进位，直接返回值 # 所有元素全部为9 return [1] + [0]
* n class Solution: def plusOne(self, digits: List[int]) -> List[int]: n =
len(digits) for i in range(n-1, -1, -1): # 倒序，步长-1 if digits[i] != 9: digits[i]
+= 1 for j in range(i + 1, n): digits[j] = 0 return digits return [1] + [0] * n
总结
奈何老衲没文化，一句C语言走天下！
