Commit7203cf7

committed

add 923

1 parent0266257 commit7203cf7Copy full SHA for 7203cf7

File tree

+57

-0

lines changed

README.md
src
- main/java/com/fishercoder/solutions
  - _923.java
- test/java/com/fishercoder
  - _923Test.java

+57

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -396,6 +396,7 @@ _If you like this project, please leave me a star._ ★`
`396`	`396`	`\|931\|[Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_931.java) \| \|Medium\|Dynamic Programming`
`397`	`397`	`\|929\|[Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_929.java)\|\|Easy\|`
`398`	`398`	`\|925\|[Long Pressed Name](https://leetcode.com/problems/long-pressed-name/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_925.java)\|\|Easy\|`
	`399`	`+\|923\|[3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_923.java) \| \|Medium\|Two Pointers`
`399`	`400`	`\|922\|[Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_922.java)\|\|Easy\|`
`400`	`401`	`\|921\|[Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_921.java) \| \|Medium\|Stack, Greedy`
`401`	`402`	`\|917\|[Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters/)\|[Solution](../master/src/main/java/com/fishercoder/solutions/_917.java)\|\|Easy\|`

Lines changed: 35 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,35 @@`
	`1`	`+packagecom.fishercoder.solutions;`
	`2`	`+`
	`3`	`+importjava.util.HashMap;`
	`4`	`+importjava.util.Map;`
	`5`	`+`
	`6`	`+publicclass_923 {`
	`7`	`+publicstaticclassSolution1 {`
	`8`	`+publicintthreeSumMulti(int[]A,inttarget) {`
	`9`	`+intMOD =1000000007;`
	`10`	`+Map<Integer,Long>map =newHashMap<>();`
	`11`	`+for (intnum :A) {`
	`12`	`+map.put(num,map.getOrDefault(num,0L) +1);`
	`13`	`+ }`
	`14`	`+longresult =0;`
	`15`	`+for (intnum1 :map.keySet()) {`
	`16`	`+for (intnum2 :map.keySet()) {`
	`17`	`+intnum3 =target -num1 -num2;`
	`18`	`+if (map.containsKey(num3)) {`
	`19`	`+Longcount1 =map.get(num1);`
	`20`	`+Longcount2 =map.get(num2);`
	`21`	`+Longcount3 =map.get(num3);`
	`22`	`+if (num1 ==num2 &&num1 ==num3) {`
	`23`	`+result = (result + (count1 * (count1 -1) * (count1 -2) /6)) %MOD;`
	`24`	`+ }elseif (num1 ==num2 &&num1 !=num3) {`
	`25`	`+result = (result + (count1 * (count1 -1) /2) *count3) %MOD;`
	`26`	`+ }elseif (num1 <num2 &&num2 <num3) {`
	`27`	`+result = (result +count1 count2 count3) %MOD;`
	`28`	`+ }`
	`29`	`+ }`
	`30`	`+ }`
	`31`	`+ }`
	`32`	`+return (int)result;`
	`33`	`+ }`
	`34`	`+ }`
	`35`	`+}`

Lines changed: 21 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,21 @@`
	`1`	`+packagecom.fishercoder;`
	`2`	`+`
	`3`	`+importcom.fishercoder.solutions._923;`
	`4`	`+importorg.junit.BeforeClass;`
	`5`	`+importorg.junit.Test;`
	`6`	`+`
	`7`	`+importstaticorg.junit.Assert.assertEquals;`
	`8`	`+`
	`9`	`+publicclass_923Test {`
	`10`	`+privatestatic_923.Solution1solution1;`
	`11`	`+`
	`12`	`+@BeforeClass`
	`13`	`+publicstaticvoidsetup() {`
	`14`	`+solution1 =new_923.Solution1();`
	`15`	`+ }`
	`16`	`+`
	`17`	`+@Test`
	`18`	`+publicvoidtest1() {`
	`19`	`+assertEquals(20,solution1.threeSumMulti(newint[]{1,1,2,2,3,3,4,4,5,5},8));`
	`20`	`+ }`
	`21`	`+}`

Comments

(0)