Re: [閒聊] 每日leetcode

看板Marginalman作者 (通通打死)時間10月前 (2025/01/23 23:15), 編輯推噓1(100)
留言1則, 1人參與, 10月前最新討論串1302/1553 (看更多)
看哪些電腦所在的col or row 真的只有它自己 然後加加減減 有點直覺的作法 看完母雞卡腦袋不行== def countServers(self, grid: List[List[int]]) -> int: m, n = len(grid), len(grid[0]) row_cnt = [0 for _ in range(m)] col_cnt = [0 for _ in range(n)] # cnt computer_cnt = 0 for i in range(m): for j in range(n): if grid[i][j] == 1: row_cnt[i] += 1 col_cnt[j] += 1 computer_cnt += 1 ans = computer_cnt for i in range(m): for j in range(n): if grid[i][j] == 1 and row_cnt[i]==1 and col_cnt[j]==1: ans -= 1 return ans -- ※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 125.229.37.69 (臺灣) ※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1737645356.A.E68.html

01/23 23:30, 10月前 , 1F
大師
01/23 23:30, 1F
文章代碼(AID): #1dabqive (Marginalman)
討論串 (同標題文章)
文章代碼(AID): #1dabqive (Marginalman)