[{"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}]
1.按要求交换某一个数组中的数
实验要求：
1、输入6个数，并将它们存入数组array中；
2、最大的与第一个元素交换，最小的与最后一个元素交换，然后输出数组。
x = eval(input()) t = [] for i in x: t.append(i) print(t) a = sorted(t) min =
a[0] max = a[5] for i in range(0,6): if t[i] == max: t[0],t[i] = t[i],t[0] elif
t[i] == min: t[5],t[i] = t[i],t[5] print(t)
2.报数游戏
实验要求
1、有n个人围成一个圈并且按照顺序排号，然后依次报1,2,3 每次报到3的人退出圈子；
2、输出每一轮报数（指剩下的人都报过一遍数）之后没有退出的号，直到剩下最后一个人。
n=eval(input()) p=[] for i in range(1,n+1): p.append(i) i=1 while len(p)!=1:
j=0 while j<len(p): if i%3==0: p.remove(p[j]) else: j=j+1 i+=1 print (p)
3.组合数字
实验要求：
1、从标准输入读取3个整型数值（可能有重复数字）
2、将这3个整型数组组合成1个三位数，最后输出所有可能组成的三位数，但数值不得重复
a = eval(input()) b = eval(input()) c = eval(input()) t = (a, b, c) s = set()
idx = (0, 1, 2) for i in idx: for j in idx: for k in idx: if i == j or j == k
or i == k: continue sum = t[i]*100 + t[j]*10 + t[k] if sum not in s: print(sum)
s.add(sum)
