Commita19e7c7

committed

add Java solution for 2001

1 parent078a2ca commita19e7c7Copy full SHA for a19e7c7

File tree

+25

-0

lines changed

src
- main/java/com/fishercoder/solutions
  - _2001.java
- test/java/com/fishercoder
  - _2001Test.java

+25

-0

lines changed

Lines changed: 22 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -22,4 +22,26 @@ public long interchangeableRectangles(int[][] rectangles) {`
`22`	`22`	`returnanswer;`
`23`	`23`	`}`
`24`	`24`	`}`
	`25`	`+`
	`26`	`+publicstaticclassSolution2 {`
	`27`	`+/**`
	`28`	`+ * credit: https://leetcode.com/problems/number-of-pairs-of-interchangeable-rectangles/discuss/1458404/Java-or-HashMap`
	`29`	`+ * <p>`
	`30`	`+ * This is an even smarter way to solve this problem:`
	`31`	`+ * whenever we encounter a rectangle that has the samw ratio we met before, just increment the answer by the count of this ratio`
	`32`	`+ * because this new rectangle could be matched up with all previously encountered ones!`
	`33`	`+ * <p>`
	`34`	`+ * This is 100% beat on all submissions on space and time as of 9/12/2021.`
	`35`	`+ */`
	`36`	`+publiclonginterchangeableRectangles(int[][]rectangles) {`
	`37`	`+Map<Double,Integer>map =newHashMap<>();`
	`38`	`+longans =0l;`
	`39`	`+for (int[]rec :rectangles) {`
	`40`	`+doubleratio = (double)rec[0] /rec[1];`
	`41`	`+ans +=map.getOrDefault(ratio,0);`
	`42`	`+map.put(ratio,map.getOrDefault(ratio,0) +1);`
	`43`	`+ }`
	`44`	`+returnans;`
	`45`	`+ }`
	`46`	`+ }`
`25`	`47`	`}`

Lines changed: 3 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -9,14 +9,17 @@`
`9`	`9`
`10`	`10`	`publicclass_2001Test {`
`11`	`11`	`privatestatic_2001.Solution1solution1;`
	`12`	`+privatestatic_2001.Solution2solution2;`
`12`	`13`
`13`	`14`	`@BeforeClass`
`14`	`15`	`publicstaticvoidsetup() {`
`15`	`16`	`solution1 =new_2001.Solution1();`
	`17`	`+solution2 =new_2001.Solution2();`
`16`	`18`	`}`
`17`	`19`
`18`	`20`	`@Test`
`19`	`21`	`publicvoidtest1() {`
`20`	`22`	`assertEquals(6,solution1.interchangeableRectangles(CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[4,8],[3,6],[10,20],[15,30]")));`
	`23`	`+assertEquals(6,solution2.interchangeableRectangles(CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[4,8],[3,6],[10,20],[15,30]")));`
`21`	`24`	`}`
`22`	`25`	`}`

Comments

(0)