说明：  匈牙利算法 1每行的所有数字减去该行的最小项 2每列的所有数字减去该列的最小项 3使用横线或者竖线穿过矩阵中的所有0，并记录达成此目的所需的最少线路总数 如果线路总数等于矩阵的行数或者列数n，那么一种最优的分配是可能的，完成。如果总数小于n，执行下一步 4找到线路未覆盖的地方的最小项，存在未覆盖的项的行减去该项，然后将该项添加到覆盖的列中
(hungarian algorithm 1 all the numbers per line subtracts the row's minimum 2 all the numbers per column subtracted the minimum item of the column 3 cross the line or vertical line through all 0 of the matrix, and record the minimum number of lines required to achieve this goal. If the total number of lines is equal to the number of rows of a matrix or the number of columns n, an optimal allocation is possible and completed. If the total is less than N, carry out the next step 4 Find the smallest item where the line is not covered, subtract it from the line that has an uncovered item, and add it to the overwritten column)