class Solution {
public long matrixSumQueries(int n, int[][] queries) {
int r = n;
int c = n;
long res = 0;
boolean[] vr = new boolean[n];
boolean[] vc = new boolean[n];
for (int i = queries.length - 1; i >= 0; i–) {
if (queries[i][0] == 0 && !vr[queries[i][1]]) {
vr[queries[i][1]] = true;
res = res + 1l * queries[i][2] * r;
c–;
}
if (queries[i][0] == 1 && !vc[queries[i][1]]) {
vc[queries[i][1]] = true;
res = res + 1l * queries[i][2] * c;
r–;
}
}
return res;
}
}
作者:Nickdd
链接:https://www.acwing.com/activity/content/code/content/6593905/
来源:AcWing
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。