[{"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}]
from itertools import combinations,permutations #检测 #生成一个排序函数 #计算逆序数 #计算行列式
Matrix = [[1,5,3],[7,4,3],[2,4,232]] #检测 def test(Matrix): #检测是否是一个方阵 for i in
Matrix: if len(i)==len(Matrix): pass for ii in i: if type(ii)==type(101): pass
else: print("请检查您输入的矩阵") print("不可靠的结果") else: print("请检查您输入的矩阵")
print("不可靠的结果") break #输出行列式阶数和n! sum = 1 for i in range(len(Matrix)+1): sum *=
i return len(Matrix),sum def InversionNumber(l): sum = 0 l0 = [] for i in
range(len(l)): if l[i] < l[i-1] and i-1 >= 0: l0.append(l[i-1]) sum += 1 for k
in range(i-1): if l[i] < l[k]: sum += 1 return (-1)**sum def Permute(n):
#返回一个列表,包含整个序列,最后一位表明(-1)^ε l = [] for k in range(1,n+1): l.append(k) L =
list(permutations(l, len(l))) for i in L: L[L.index(i)]=list(i) for i in L:
i.append(InversionNumber(i)) return L def main(Matrix): l,S = test(Matrix) L =
Permute(l) sum = 0 for i in L: sum1 = 1 for ii in range(len(Matrix)): sum1 *=
Matrix[ii][i[ii]-1] sum1 *= i[-1] sum += sum1 return sum if __name__ ==
"__main__": det = main(Matrix)
这个提示一下,咱们得先修改最上头那一段Matrix
写入您想计算的那个哦!
