My LeetCode grinding. Trying to do a problem a day.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

problem.txt 927B

123456789101112131415161718192021222324252627282930
  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.
  2. Return the number of cells with odd values in the matrix after applying the increment to all indices.
  3. (There was pictures here, but hopefully this is clear enough)
  4. Example 1:
  5. Input: n = 2, m = 3, indices = [[0,1],[1,1]]
  6. Output: 6
  7. Explanation: Initial matrix = [[0,0,0],[0,0,0]].
  8. After applying first increment it becomes [[1,2,1],[0,1,0]].
  9. The final matrix will be [[1,3,1],[1,3,1]] which contains 6 odd numbers.
  10. Example 2:
  11. Input: n = 2, m = 2, indices = [[1,1],[0,0]]
  12. Output: 0
  13. Explanation: Final matrix = [[2,2],[2,2]]. There is no odd number in the final matrix.
  14. Constraints:
  15. 1 <= n <= 50
  16. 1 <= m <= 50
  17. 1 <= indices.length <= 100
  18. 0 <= indices[i][0] < n
  19. 0 <= indices[i][1] < m