Commiteee5a93

committed

add 598

1 parentd33a25f commiteee5a93Copy full SHA for eee5a93

File tree

+27

-0

lines changed

src
- main/java/com/fishercoder/solutions
  - _598.java
- test/java/com/fishercoder
  - _598Test.java

+27

-0

lines changed

Lines changed: 4 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -3,6 +3,10 @@`
`3`	`3`	`publicclass_598 {`
`4`	`4`
`5`	`5`	`publicstaticclassSolution1 {`
	`6`	`+/**`
	`7`	`+ * Since the incrementing starts from zero to op[0] and op[1], we only need to find the range that has the most overlaps.`
	`8`	`+ * Thus we keep finding the minimum of both x and y.`
	`9`	`+ */`
`6`	`10`	`publicintmaxCount(intm,intn,int[][]ops) {`
`7`	`11`	`intx =m;`
`8`	`12`	`inty =n;`

Lines changed: 23 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,23 @@`
	`1`	`+packagecom.fishercoder;`
	`2`	`+`
	`3`	`+importcom.fishercoder.common.utils.CommonUtils;`
	`4`	`+importcom.fishercoder.solutions._598;`
	`5`	`+importorg.junit.BeforeClass;`
	`6`	`+importorg.junit.Test;`
	`7`	`+`
	`8`	`+importstaticorg.junit.Assert.assertEquals;`
	`9`	`+`
	`10`	`+publicclass_598Test {`
	`11`	`+privatestatic_598.Solution1solution1;`
	`12`	`+`
	`13`	`+@BeforeClass`
	`14`	`+publicstaticvoidsetup() {`
	`15`	`+solution1 =new_598.Solution1();`
	`16`	`+ }`
	`17`	`+`
	`18`	`+@Test`
	`19`	`+publicvoidtest1() {`
	`20`	`+assertEquals(4,solution1.maxCount(3,3,CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[2,2],[3,3]")));`
	`21`	`+ }`
	`22`	`+`
	`23`	`+}`

Comments

(0)