[LeetCode] 1337. The K Weakest Rows in a Matrix 矩阵中战斗力最弱的 K 行

You are given an m x n binary matrix mat of 1's (representing soldiers) and 0's (representing civilians). The soldiers are positioned in front of the
posted @ 2023-03-27 10:40  Grandyang  阅读(183)  评论(0编辑  收藏  举报
Fork me on GitHub