Commit6f861ca

committed

add 1572

1 parent95c308d commit6f861caCopy full SHA for 6f861ca

File tree

+78

-0

lines changed

README.md
src
- main/java/com/fishercoder/solutions
  - _1572.java
- test/java/com/fishercoder
  - _1572Test.java

+78

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★`
`8`	`8`
`9`	`9`	`\| # \| Title \| Solutions \| Video \| Difficulty \| Tag`
`10`	`10`	`\|-----\|----------------\|---------------\|--------\|-------------\|-------------`
	`11`	`+\|1572\|[Matrix Diagonal Sum](https://leetcode.com/problems/matrix-diagonal-sum/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_1572.java)\|\|Array\|Easy\|`
`11`	`12`	`\|1567\|[Maximum Length of Subarray With Positive Product](https://leetcode.com/problems/maximum-length-of-subarray-with-positive-product/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_1567.java)\|[:tv:](https://youtu.be/bFer5PdsgpY)\|Greedy\|Medium\|`
`12`	`13`	`\|1566\|[Detect Pattern of Length M Repeated K or More Times](https://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_1566.java)\|[:tv:](https://youtu.be/aJAV_VgmjdE)\|Array\|Easy\|`
`13`	`14`	`\|1561\|[Maximum Number of Coins You Can Get](https://leetcode.com/problems/maximum-number-of-coins-you-can-get/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_1561.java)\|[:tv:](https://youtu.be/hPe9Z3TiUrA)\|Sort\|Medium\|`

Lines changed: 30 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,30 @@`
	`1`	`+packagecom.fishercoder.solutions;`
	`2`	`+`
	`3`	`+importjava.util.HashSet;`
	`4`	`+importjava.util.Set;`
	`5`	`+`
	`6`	`+publicclass_1572 {`
	`7`	`+publicstaticclassSolution1 {`
	`8`	`+publicintdiagonalSum(int[][]mat) {`
	`9`	`+intm =mat.length;`
	`10`	`+Set<Integer>added =newHashSet<>();`
	`11`	`+intsum =0;`
	`12`	`+for (inti =0;i <m;i++) {`
	`13`	`+for (intj =0;j <m;j++) {`
	`14`	`+if (i ==j) {`
	`15`	`+added.add(i *m +j);`
	`16`	`+sum +=mat[i][j];`
	`17`	`+ }`
	`18`	`+ }`
	`19`	`+ }`
	`20`	`+for (inti =0;i <m;i++) {`
	`21`	`+for (intj =m -1;j >=0;j--) {`
	`22`	`+if (i +j ==m -1 &&added.add(i *m +j)) {`
	`23`	`+sum +=mat[i][j];`
	`24`	`+ }`
	`25`	`+ }`
	`26`	`+ }`
	`27`	`+returnsum;`
	`28`	`+ }`
	`29`	`+ }`
	`30`	`+}`

Lines changed: 47 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,47 @@`
	`1`	`+packagecom.fishercoder;`
	`2`	`+`
	`3`	`+importcom.fishercoder.solutions._1572;`
	`4`	`+importorg.junit.BeforeClass;`
	`5`	`+importorg.junit.Test;`
	`6`	`+`
	`7`	`+importstaticjunit.framework.TestCase.assertEquals;`
	`8`	`+`
	`9`	`+publicclass_1572Test {`
	`10`	`+privatestatic_1572.Solution1solution1;`
	`11`	`+privatestaticint[][]mat;`
	`12`	`+`
	`13`	`+@BeforeClass`
	`14`	`+publicstaticvoidsetup() {`
	`15`	`+solution1 =new_1572.Solution1();`
	`16`	`+ }`
	`17`	`+`
	`18`	`+@Test`
	`19`	`+publicvoidtest1() {`
	`20`	`+mat =newint[][]{`
	`21`	`+ {1,2,3},`
	`22`	`+ {4,5,6},`
	`23`	`+ {7,8,9}`
	`24`	`+ };`
	`25`	`+assertEquals(25,solution1.diagonalSum(mat));`
	`26`	`+ }`
	`27`	`+`
	`28`	`+@Test`
	`29`	`+publicvoidtest2() {`
	`30`	`+mat =newint[][]{`
	`31`	`+ {5}`
	`32`	`+ };`
	`33`	`+assertEquals(5,solution1.diagonalSum(mat));`
	`34`	`+ }`
	`35`	`+`
	`36`	`+@Test`
	`37`	`+publicvoidtest3() {`
	`38`	`+mat =newint[][]{`
	`39`	`+ {1,1,1,1},`
	`40`	`+ {1,1,1,1},`
	`41`	`+ {1,1,1,1},`
	`42`	`+ {1,1,1,1},`
	`43`	`+ };`
	`44`	`+assertEquals(8,solution1.diagonalSum(mat));`
	`45`	`+ }`
	`46`	`+`
	`47`	`+}`

Comments

(0)