标签：
Given two arrays, write a function to compute their intersection.
Example:
Given nums1 = [1, 2, 2, 1], nums2 = [2,
2], return [2, 2].
Note:
Follow up:
Subscribe to see which companies asked this question
java code:
public class Solution {
public int[] intersect(int[] nums1, int[] nums2) {
int len1 = nums2.length,len2 = nums2.length;
List<Integer> list = new ArrayList<Integer>();
List<Integer> interList = new ArrayList<Integer>();
for(int num:nums1) {
list.add(num);
}
for(int i=0;i<len2;i++) {
if(list.contains(nums2[i])) {
interList.add(nums2[i]);
list.remove(list.indexOf(nums2[i]));
}
}
int[] ret = new int[interList.size()];
int cnt = 0;
for(int num:interList) {
ret[cnt++] = num;
}
return ret;
}
}LeetCode:Intersection of Two Arrays II
标签：
原文地址：http://blog.csdn.net/itismelzp/article/details/51474073
