python3 解法, 执行用时: 52 ms, 内存消耗: 19 MB, 提交时间: 2023-01-03 12:04:18

class Solution:
    def leastBricks(self, wall: List[List[int]]) -> int:
        cnt = defaultdict(int)
        for widths in wall:
            _sum = 0
            for width in widths[:len(widths)-1]:
                _sum += width
                cnt[_sum] += 1
        
        maxCnt = 0
        for _, c in cnt.items():
            if c > maxCnt:
                maxCnt = c
        
        return len(wall) - maxCnt

golang 解法, 执行用时: 20 ms, 内存消耗: 7.1 MB, 提交时间: 2023-01-03 11:58:23

func leastBricks(wall [][]int) int {
    cnt := map[int]int{}
    for _, widths := range wall {
        sum := 0
        for _, width := range widths[:len(widths)-1] {
            sum += width
            cnt[sum]++
        }
    }
    maxCnt := 0
    for _, c := range cnt {
        if c > maxCnt {
            maxCnt = c
        }
    }
    return len(wall) - maxCnt
}