class Solution {
public int firstCompleteIndex(int[] arr, int[][] mat) {
int n = mat.length;
int m = mat[0].length;
Map<Integer, int[]> map = new HashMap<Integer, int[]>();
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
map.put(mat[i][j], new int[]{i, j});
}
}
int[] rowCnt = new int[n];
int[] colCnt = new int[m];
for (int i = 0; i < arr.length; ++i) {
int[] v = map.get(arr[i]);
++rowCnt[v[0]];
if (rowCnt[v[0]] == m) {
return i;
}
++colCnt[v[1]];
if (colCnt[v[1]] == n) {
return i;
}
}
return -1;
}
}
class Solution {
public:
int firstCompleteIndex(vector<int>& arr, vector<vector<int>>& mat) {
unordered_map<int, pair<int, int>> hash;
int m = mat.size(), n = mat[0].size();
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; ++j) hash[mat[i][j]] = {i ,j};
}
vector<int> row(m), col(n);
for (int i = 0; i < arr.size(); ++i) {
auto it = hash[arr[i]];
++row[it.first], ++col[it.second];
if (row[it.first] == n || col[it.second] == m) return i;
}
return -1;
}
};
func firstCompleteIndex(arr []int, mat [][]int) int {
m, n := len(mat), len(mat[0])
type pair struct{ r, c int }
pos := make([]pair, m*n+1)
for i, row := range mat {
for j, x := range row {
pos[x] = pair{i, j}
}
}
rowCnt := make([]int, m)
colCnt := make([]int, n)
for i, x := range arr {
p := pos[x]
rowCnt[p.r]++
colCnt[p.c]++
if rowCnt[p.r] == n || colCnt[p.c] == m {
return i
}
}
return -1
}
'''
首先遍历 mat，用一个 pos 数组记录 mat[i][j] 在 mat 中位置。
然后遍历 arr[i]，同时用两个数组 rowCnt 和 colCnt 记录每行每列的涂色个数。
如果出现某一行或某一列上都被涂色的情况，就返回 1。
'''
class Solution:
def firstCompleteIndex(self, arr: List[int], mat: List[List[int]]) -> int:
m, n = len(mat), len(mat[0])
pos = [0] * (m * n + 1)
for i, row in enumerate(mat):
for j, x in enumerate(row):
pos[x] = (i, j)
row_cnt = [0] * m
col_cnt = [0] * n
for i, x in enumerate(arr):
r, c = pos[x]
row_cnt[r] += 1
col_cnt[c] += 1
if row_cnt[r] == n or col_cnt[c] == m:
return i
