add one more solution for 1252

Author: fishercoder1534

README.md

@@ -27,7 +27,7 @@ Your ideas/fixes/algorithms are more than welcome!
 
 |  #  |      Title     |   Solutions   | Time          | Space         | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|---------------|---------------|--------|-------------|-------------
-|1252|[Cells with Odd Values in a Matrix](https://leetcode.com/problems/cells-with-odd-values-in-a-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1252.java) | O(m*n) | O(1) | |Easy||
+|1252|[Cells with Odd Values in a Matrix](https://leetcode.com/problems/cells-with-odd-values-in-a-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1252.java) | O(m*n + k) | O(m*n) | |Easy||
 |1207|[Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1207.java) | O(n) | O(1) | |Easy||
 |1160|[Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1160.java) | O(n) | O(m) | |Easy||
 |1154|[Day of the Year](https://leetcode.com/problems/day-of-the-year/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1154.java) | O(1) | O(1) | |Easy||

src/main/java/com/fishercoder/solutions/_1252.java

@@ -34,6 +34,10 @@
  * */
 public class _1252 {
     public static class Solution1 {
+        /**
+         * Time: O(m*n + k) where k is the length of indices
+         * Space: O(m*n)
+         * */
         public int oddCells(int n, int m, int[][] indices) {
             int[][] matrix = new int[n][m];
             for (int i = 0; i < indices.length; i++) {
@@ -63,4 +67,26 @@ private void addOneToRow(int[][] matrix, int rowIndex) {
             }
         }
     }
+
+    public static class Solution2 {
+        /**
+         * Time: O(m*n + k) where k is the length of indices
+         * Space: O(m + n)
+         */
+        public int oddCells(int n, int m, int[][] indices) {
+            boolean[] row = new boolean[n];
+            boolean[] column = new boolean[m];
+            for (int[] index : indices) {
+                row[index[0]] ^= true;
+                column[index[1]] ^= true;
+            }
+            int oddNumberCount = 0;
+            for (int i = 0; i < n; i++) {
+                for (int j = 0; j < m; j++) {
+                    oddNumberCount += row[i] ^ column[j] ? 1 : 0;
+                }
+            }
+            return oddNumberCount;
+        }
+    }
 }

src/test/java/com/fishercoder/_1252Test.java

@@ -8,11 +8,13 @@
 
 public class _1252Test {
     private static _1252.Solution1 solution1;
+    private static _1252.Solution2 solution2;
     private static int[][] indices;
 
     @BeforeClass
     public static void setup() {
         solution1 = new _1252.Solution1();
+        solution2 = new _1252.Solution2();
     }
 
     @Test
@@ -33,4 +35,22 @@ public void test2() {
         assertEquals(0, solution1.oddCells(2, 2, indices));
     }
 
+    @Test
+    public void test3() {
+        indices = new int[][]{
+                {0, 1},
+                {1, 1}
+        };
+        assertEquals(6, solution2.oddCells(2, 3, indices));
+    }
+
+    @Test
+    public void test4() {
+        indices = new int[][]{
+                {1, 1},
+                {0, 0}
+        };
+        assertEquals(0, solution2.oddCells(2, 2, indices));
+    }
+
 }