350. Intersection of Two Arrays II

Posted 2020-07-12 烁宝宝

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

Example:
Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2].

Note:

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

代码如下：

 1 public class Solution {
 2     public int[] intersect(int[] nums1, int[] nums2) {
 3         List<Integer> list=new ArrayList<>();
 4         
 5         Arrays.sort(nums1);
 6         Arrays.sort(nums2);
 7     
 8             for(int i=0,j=0;i<nums1.length&&j<nums2.length;)
 9             {
10                 if(nums1[i]==nums2[j])
11                 {
12                 list.add(nums1[i]);
13                 i++;
14                 j++;
15                 }
16                 else if(nums1[i]<nums2[j])
17                 i++;
18                 else if(nums1[i]>nums2[j])
19                 j++;
20             }
21         int[] result=new int[list.size()];
22         for(int i=0;i<list.size();i++)
23         result[i]=list.get(i);
24         
25         return result;
26         
27     }
28 }