Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit2488960

Browse files
4Sum II
1 parenta931764 commit2488960

File tree

2 files changed

+44
-0
lines changed

2 files changed

+44
-0
lines changed

‎MEDIUM/src/medium/_4SumII.java

Lines changed: 43 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,43 @@
1+
packagemedium;
2+
3+
importjava.util.Arrays;
4+
importjava.util.HashMap;
5+
importjava.util.Map;
6+
7+
publicclass_4SumII {
8+
9+
/**Although it's tagged with BinarySearch and HashTable, I didn't come up with a good BinarySearch solution, then looked at this post:
10+
* https://discuss.leetcode.com/topic/67658/simple-java-solution-with-explanation*/
11+
publicstaticintfourSumCount(int[]A,int[]B,int[]C,int[]D) {
12+
Map<Integer,Integer>map =newHashMap();
13+
intresult =0,len =A.length;
14+
for (inti =0;i <len;i++){
15+
for (intj =0;j <len;j++){
16+
intsum =A[i] +B[j];
17+
if (map.containsKey(sum)){
18+
map.put(sum,map.get(sum)+1);
19+
}else {
20+
map.put(sum,1);
21+
}
22+
}
23+
}
24+
25+
for (inti =0;i <len;i++){
26+
for (intj =0;j <len;j++){
27+
intsum = -(C[i] +D[j]);
28+
if(map.containsKey(sum))result +=map.get(sum);
29+
}
30+
}
31+
32+
returnresult;
33+
}
34+
35+
publicstaticvoidmain(String...args){
36+
int[]A =newint[]{1,2};
37+
int[]B =newint[]{-2,-1};
38+
int[]C =newint[]{-1,2};
39+
int[]D =newint[]{0,2};
40+
41+
System.out.println(fourSumCount(A,B,C,D));
42+
}
43+
}

‎README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -6,6 +6,7 @@
66
|459|[Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern/)|[Solution](../../blob/master/EASY/src/easy/RepeatedSubstringPattern.java)| O(n)|O(n) | Easy| KMP
77
|456|[132 Pattern](https://leetcode.com/problems/132-pattern/)|[Solution](../../blob/master/MEDIUM/src/medium/_132Pattern.java) | O(n) |O(n) | Medium| Stack
88
|455|[Assign Cookies](https://leetcode.com/problems/assign-cookies/)|[Solution](../../blob/master/EASY/src/easy/AssignCookies.java)| O(n)|O(1)| Easy|
9+
|454|[4Sum II](https://leetcode.com/problems/4sum-ii/)|[Solution](../../blob/master/MEDIUM/src/medium/_4SumII.java) | O(n) |O(n) | Medium| HashMap
910
|453|[Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements/)|[Solution](../../blob/master/EASY/src/easy/MinimumMovestoEqualArrayElements.java)| O(n)|O(1)| Easy|
1011
|447|[Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs/)|[Solution](../../blob/master/EASY/src/easy/NumberofBoomerangs.java)| O(n^2)|O(n) | Easy| HashMap
1112
|441|[Arranging Coins](https://leetcode.com/problems/arrange-coins/)|[Solution](../../blob/master/EASY/src/easy/ArrangingCoins.java)| O(n)|O(1)| Easy|

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp