现在我们让问题变得复杂点：你有一个二维的无符号整形数组，你想要找到具有最小和的那一行。

Now let's complicate the problem a bit: you have a two-dimensional array of unsigned integers, and you want to find the row with the smallest sum.

youdao

现在我们让问题变得复杂点：你有一个二维的无符号整形数组，你想要找到具有最小和的那一行。

Now let's complicate the problem a bit: you have a two-dimensional array of unsigned integers, and you want to find the row with the smallest sum.

youdao