Leetcode题解 349. Intersection of Two Arrays

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

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

Note:
Each element in the result must be unique.
The result can be in any order.

参照《程序员面试金典》字符串那章，有类似的题目。

public class Solution {
    public int[] intersection(int[] nums1, int[] nums2) {
        int len=100000;
        int[] temp1=new int[len];
        int[] temp2=new int[len];

        for(int i=0;i<nums1.length;i++){
            temp1[nums1[i]]=1;
        }
        for(int i=0;i<nums2.length;i++){
            temp2[nums2[i]]=1;
        }
        int count=0;
        for(int i=0;i<len;i++){
            if(temp1[i]==temp2[i]&&temp1[i]!=0){
               count++;
            }
        }
        int[] result=new int[count];
        int pos=0;
         for(int i=0;i<len;i++){
            if(temp1[i]==temp2[i]&&temp1[i]!=0){
               result[pos]=i;
               pos++;
            }
        }
        return result;
    }
}