Leetcode 1337. 矩阵中战斗力最弱的 K 行

Leetcode 1337. 矩阵中战斗力最弱的 K 行

1. 问题描述

2. 思路

1. 计算每一行士兵的战斗力，存入power
2. 对power排序

3. 代码

type Power struct {
    Value int
    Row int
}

func kWeakestRows(mat [][]int, k int) []int {
    var res []int
    var powers []Power
    for i := 0; i < len(mat); i++ {
        power := Power {
            Value : countPower(mat[i]),
            Row : i,
        }
        // fmt.Printf("i == %v, power == %v, row == %v\n", i, power.Value, power.Row)
        powers = append(powers, power)
    }

    sort.SliceStable(powers, func(i, j int) bool {
        return powers[i].Value < powers[j].Value
    })
    for i := 0; i < k; i++ {
        res = append(res, powers[i].Row)
    }
    return res
}

func countPower(arr []int) int {
    i := 0
    for i < len(arr) && arr[i] == 1 {
        i++
    }
    return i
}