Commit459215b

committed

add 781

1 parente906334 commit459215bCopy full SHA for 459215b

File tree

+78

-0

lines changed

README.md
src
- main/java/com/fishercoder/solutions
  - _781.java
- test/java/com/fishercoder
  - _781Test.java

+78

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -362,6 +362,7 @@ _If you like this project, please leave me a star._ ★`
`362`	`362`	`\|788\|[Rotated Digits](https://leetcode.com/problems/rotated-digits/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_788.java)\|\|Easy\|`
`363`	`363`	`\|784\|[Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_784.java)\|\|Easy\|`
`364`	`364`	`\|783\|[Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_783.java)\|\|Easy\|`
	`365`	`+\|781\|[Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_781.java) \| \|Medium\| HashTable, Math`
`365`	`366`	`\|779\|[K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_779.java)\|\|Medium\|`
`366`	`367`	`\|776\|[Split BST](https://leetcode.com/problems/split-bst/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_776.java) \| \|Medium\| Recursion`
`367`	`368`	`\|771\|[Jewels and Stones](https://leetcode.com/problems/jewels-and-stones/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_771.java)\|\|Easy\|`

Lines changed: 31 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,31 @@`
	`1`	`+packagecom.fishercoder.solutions;`
	`2`	`+`
	`3`	`+importjava.util.HashMap;`
	`4`	`+importjava.util.Map;`
	`5`	`+`
	`6`	`+publicclass_781 {`
	`7`	`+publicstaticclassSolution1 {`
	`8`	`+publicintnumRabbits(int[]answers) {`
	`9`	`+Map<Integer,Integer>map =newHashMap<>();`
	`10`	`+intrabbits =0;`
	`11`	`+for (intrabbitType :answers) {`
	`12`	`+if (map.containsKey(rabbitType)) {`
	`13`	`+intcount =map.get(rabbitType);`
	`14`	`+count--;`
	`15`	`+if (count ==0) {`
	`16`	`+map.remove(rabbitType);`
	`17`	`+ }else {`
	`18`	`+map.put(rabbitType,count);`
	`19`	`+ }`
	`20`	`+ }else {`
	`21`	`+rabbits +=rabbitType;`
	`22`	`+rabbits++;`
	`23`	`+if (rabbitType !=0) {`
	`24`	`+map.put(rabbitType,rabbitType);`
	`25`	`+ }`
	`26`	`+ }`
	`27`	`+ }`
	`28`	`+returnrabbits;`
	`29`	`+ }`
	`30`	`+ }`
	`31`	`+}`

Lines changed: 46 additions & 0 deletions

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

Comments

(0)