Leetcode
2020.04.28 04:09

# 350. Intersection of Two Arrays II

조회 수 102 추천 수 0 댓글 0
?

#### 단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄
?

#### 단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄

Given two arrays, write a function to compute their intersection.

Example 1:

```Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [2,2]
```

Example 2:

```Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output: [4,9]```

Note:

• Each element in the result should appear as many times as it shows in both arrays.
• The result can be in any order.

• What if the given array is already sorted? How would you optimize your algorithm?
• What if nums1's size is small compared to nums2's size? Which algorithm is better?
• What if elements of nums2 are stored on disk, and the memory is limited such that you cannot load all elements into the memory at once?

```class Solution {
public int[] intersect(int[] nums1, int[] nums2) {
Map<Integer, Integer> hmap = new HashMap<>();
List<Integer> list = new ArrayList<>();

for(int i=0; i<nums1.length; i++){
hmap.put(nums1[i], hmap.getOrDefault(nums1[i],0)+1);
}

for(int i=0; i<nums2.length; i++){
if(hmap.getOrDefault(nums2[i], 0) > 0){
hmap.put(nums2[i], hmap.getOrDefault(nums2[i], 0)-1);
}
}

int[] result = new int[list.size()];
for(int i=0; i<list.size(); i++){
result[i] = list.get(i);
}

return result;
}
}```

?

 제목+내용제목내용댓글이름닉네임아이디태그
List of Articles
번호 분류 제목 글쓴이 날짜 조회 수
74 Leetcode 692. Top K Frequent Words 2020.04.15 87
73 Leetcode 2. Add Two Numbers 2020.04.14 90
72 Leetcode 731. My Calendar II 2020.04.15 94
71 Leetcode 75. Sort Colors 2020.04.14 95
70 Leetcode 347. Top K Frequent Elements 2020.04.14 96
69 Leetcode 430. Flatten a Multilevel Doubly Linked List 2020.04.06 98
68 Leetcode 23. Merge k Sorted Lists 2020.04.14 98
67 Leetcode 729. My Calendar I 2020.04.15 98
66 Leetcode 253. Meeting Rooms II 2020.04.15 98
65 Leetcode 20. Valid Parentheses 2020.04.25 98
64 Leetcode 62. Unique Paths 2020.04.09 99
63 Leetcode 7. Reverse Integer 2020.04.28 100
62 Leetcode 946. Validate Stack Sequences 2020.04.08 101
61 Leetcode 973. K Closest Points to Origin 2020.04.15 101
60 Leetcode 852. Peak Index in a Mountain Array 2020.04.28 101
» Leetcode 350. Intersection of Two Arrays II 2020.04.28 102
58 Leetcode 443. String Compression 2020.04.25 103
57 Leetcode 38. Count and Say 2020.04.25 103
56 Leetcode 53. Maximum Subarray 2020.04.28 106
55 Leetcode 3. Longest Substring Without Repeating Characters 2020.04.09 107
Board Pagination Prev 1 2 3 4 Next
/ 4