Re: [閒聊] 每日leetcode

[JIWP (神楽めあ的錢包)]

2661. First Completely Painted Row or Column

思路:

就記錄每個數字所在的行、列

接著去遍歷arr

看哪一行、哪一列先湊齊

沒什麼難度

golang code :

func firstCompleteIndex(arr []int, mat [][]int) int {
        n, m := len(mat), len(mat[0])
        rec := make([][2]int, len(arr)+1)
        cnt := make([]int, n+m)
        for i := 0; i < n; i++ {
                for j := 0; j < m; j++ {
                        rec[mat[i][j]] = [2]int{i, j + n}
                }
        }
        for key, val := range arr {
                cnt[rec[val][0]]++
                cnt[rec[val][1]]++
                if cnt[rec[val][0]] == m || cnt[rec[val][1]] == n {
                        return key
                }
        }
        return -1
}

--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 42.72.238.230 (臺灣)
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1737380294.A.585.html
推 sustainer123: 大師
推 DJYOMIYAHINA: 卷爽沒