求矩阵鞍点个数
def judge(num): ls1 = [] count = 0 for i in range(num): ls1.append(list(map(int, input().split()))) for i in range(num): row_max = max(ls1[i]) for j in range(num): col_min = min([ls1[k][j] for k in range.
