You are given a String[] table containing only zeroes and ones and describing a rectangular grid. The jth character of the ith element of table corresponds to the value in the ith row and jth column of the grid (all indices are 0based).
Return the minimal number of moves required to change all the cells in the grid to zeroes. This will always be possible.
In each move, you choose a single cell (R, C) in the grid (Rth row, Cth column).
This inverts the values of all cells (r, c), where r is between 0 and R, inclusive, and c is between 0 and C, inclusive. Inverting the value of a cell means changing zero to one and vice versa.
