def digui(det):
if len(det)<=1:
return det[0][0]
else:
s=0
det0= [[row[j] for j in range(1,len(det))] for row in det]
for i in range(len(det)):
det1=det0[:]
det1.pop(i)
if i % 2 == 0:
s+=det[i][0]*digui(det1)
else:
s-=det[i][0]*digui(det1)
return s
m=eval(input("请以列表的形式输入行列式"))
print(digui(m))
递归函数求行列式的值 python
最新推荐文章于 2024-04-20 15:12:20 发布