-
Notifications
You must be signed in to change notification settings - Fork 0
/
1252.cells-with-odd-values-in-a-matrix.java
82 lines (77 loc) · 2.07 KB
/
1252.cells-with-odd-values-in-a-matrix.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
/*
* @lc app=leetcode id=1252 lang=java
*
* [1252] Cells with Odd Values in a Matrix
*
* https://leetcode.com/problems/cells-with-odd-values-in-a-matrix/description/
*
* algorithms
* Easy (78.27%)
* Likes: 354
* Dislikes: 584
* Total Accepted: 47.9K
* Total Submissions: 61.1K
* Testcase Example: '2\n3\n[[0,1],[1,1]]'
*
* Given n and m which are the dimensions of a matrix initialized by zeros and
* given an array indices where indices[i] = [ri, ci]. For each pair of [ri,
* ci] you have to increment all cells in row ri and column ci by 1.
*
* Return the number of cells with odd values in the matrix after applying the
* increment to all indices.
*
*
* Example 1:
*
*
* Input: n = 2, m = 3, indices = [[0,1],[1,1]]
* Output: 6
* Explanation: Initial matrix = [[0,0,0],[0,0,0]].
* After applying first increment it becomes [[1,2,1],[0,1,0]].
* The final matrix will be [[1,3,1],[1,3,1]] which contains 6 odd numbers.
*
*
* Example 2:
*
*
* Input: n = 2, m = 2, indices = [[1,1],[0,0]]
* Output: 0
* Explanation: Final matrix = [[2,2],[2,2]]. There is no odd number in the
* final matrix.
*
*
*
* Constraints:
*
*
* 1 <= n <= 50
* 1 <= m <= 50
* 1 <= indices.length <= 100
* 0 <= indices[i][0] < n
* 0 <= indices[i][1] < m
*
*
*/
// @lc code=start
class Solution {
public int oddCells(int n, int m, int[][] indices) {
int[][] mat =new int [n][m];
for(int i=0;i<n;i++) //inserting 0 in all indexs
for(int j=0;j<m;j++)
mat[i][j]=0;
int size=indices.length;
for(int k=0;k<size;k++){
for(int col=0;col<m;col++)
mat[indices[k][0]][col]++;
for(int row=0;row<n;row++)
mat[row][indices[k][1]]++;
}
int c=0;
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
if(mat[i][j]%2==1 &&1==1)
c++;
return c;
}
}
// @lc code=end