Commitfa9208b

committed

add one more solution for 1252

1 parente6e57b0 commitfa9208bCopy full SHA for fa9208b

File tree

+47

-1

lines changed

README.md
src
- main/java/com/fishercoder/solutions
  - _1252.java
- test/java/com/fishercoder
  - _1252Test.java

+47

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -27,7 +27,7 @@ Your ideas/fixes/algorithms are more than welcome!`
`27`	`27`
`28`	`28`	`\| # \| Title \| Solutions \| Time \| Space \| Video \| Difficulty \| Tag`
`29`	`29`	`\|-----\|----------------\|---------------\|---------------\|---------------\|--------\|-------------\|-------------`
`30`		`-\|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\|\|`
	`30`	`+\|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(mn + k)\| O(mn)\|\|Easy\|\|`
`31`	`31`	`\|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\|\|`
`32`	`32`	`\|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\|\|`
`33`	`33`	`\|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\|\|`

Lines changed: 26 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -34,6 +34,10 @@`
`34`	`34`	`* */`
`35`	`35`	`publicclass_1252 {`
`36`	`36`	`publicstaticclassSolution1 {`
	`37`	`+/**`
	`38`	`+ * Time: O(m*n + k) where k is the length of indices`
	`39`	`+ * Space: O(m*n)`
	`40`	`+ * */`
`37`	`41`	`publicintoddCells(intn,intm,int[][]indices) {`
`38`	`42`	`int[][]matrix =newint[n][m];`
`39`	`43`	`for (inti =0;i <indices.length;i++) {`
`@@ -63,4 +67,26 @@ private void addOneToRow(int[][] matrix, int rowIndex) {`
`63`	`67`	`}`
`64`	`68`	`}`
`65`	`69`	`}`
	`70`	`+`
	`71`	`+publicstaticclassSolution2 {`
	`72`	`+/**`
	`73`	`+ * Time: O(m*n + k) where k is the length of indices`
	`74`	`+ * Space: O(m + n)`
	`75`	`+ */`
	`76`	`+publicintoddCells(intn,intm,int[][]indices) {`
	`77`	`+boolean[]row =newboolean[n];`
	`78`	`+boolean[]column =newboolean[m];`
	`79`	`+for (int[]index :indices) {`
	`80`	`+row[index[0]] ^=true;`
	`81`	`+column[index[1]] ^=true;`
	`82`	`+ }`
	`83`	`+intoddNumberCount =0;`
	`84`	`+for (inti =0;i <n;i++) {`
	`85`	`+for (intj =0;j <m;j++) {`
	`86`	`+oddNumberCount +=row[i] ^column[j] ?1 :0;`
	`87`	`+ }`
	`88`	`+ }`
	`89`	`+returnoddNumberCount;`
	`90`	`+ }`
	`91`	`+ }`
`66`	`92`	`}`

Lines changed: 20 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -8,11 +8,13 @@`
`8`	`8`
`9`	`9`	`publicclass_1252Test {`
`10`	`10`	`privatestatic_1252.Solution1solution1;`
	`11`	`+privatestatic_1252.Solution2solution2;`
`11`	`12`	`privatestaticint[][]indices;`
`12`	`13`
`13`	`14`	`@BeforeClass`
`14`	`15`	`publicstaticvoidsetup() {`
`15`	`16`	`solution1 =new_1252.Solution1();`
	`17`	`+solution2 =new_1252.Solution2();`
`16`	`18`	`}`
`17`	`19`
`18`	`20`	`@Test`
`@@ -33,4 +35,22 @@ public void test2() {`
`33`	`35`	`assertEquals(0,solution1.oddCells(2,2,indices));`
`34`	`36`	`}`
`35`	`37`
	`38`	`+@Test`
	`39`	`+publicvoidtest3() {`
	`40`	`+indices =newint[][]{`
	`41`	`+ {0,1},`
	`42`	`+ {1,1}`
	`43`	`+ };`
	`44`	`+assertEquals(6,solution2.oddCells(2,3,indices));`
	`45`	`+ }`
	`46`	`+`
	`47`	`+@Test`
	`48`	`+publicvoidtest4() {`
	`49`	`+indices =newint[][]{`
	`50`	`+ {1,1},`
	`51`	`+ {0,0}`
	`52`	`+ };`
	`53`	`+assertEquals(0,solution2.oddCells(2,2,indices));`
	`54`	`+ }`
	`55`	`+`
`36`	`56`	`}`

Comments

(0)