21 lines
632 B
Python
21 lines
632 B
Python
# https://leetcode.com/problems/find-missing-and-repeated-values
|
|
|
|
from typing import List
|
|
|
|
class Solution:
|
|
def findMissingAndRepeatedValues(self, grid: List[List[int]]) -> List[int]:
|
|
result: List[int] = []
|
|
counts = {}
|
|
n = len(grid) ** 2
|
|
expected_sum = n * (n + 1) // 2
|
|
actual_sum = 0
|
|
for row in grid:
|
|
for val in row:
|
|
actual_sum += val
|
|
if val in counts:
|
|
result.append(val)
|
|
else:
|
|
counts[val] = 1
|
|
result.append(result[0] - (actual_sum - expected_sum))
|
|
return result
|
|
|