Java 二叉搜索树

class Solution {
    public int[] intersection(int[] nums1, int[] nums2) {
        int[] a = new int[1000];
        HashSet<Integer> set = new HashSet<Integer>();
        for(int i = 0;i<nums1.length;i++){
            if(a[nums1[i]]==0){
                a[nums1[i]]=1;
            }
        }
        for(int i = 0;i<nums2.length;i++){
            if(a[nums2[i]]!=0){
                set.add(nums2[i]);
            }
        }
        int[] w = new int[set.size()];
        int p = 0;
        Iterator<Integer> iterator = set.iterator();
        while (iterator.hasNext()){
            w[p] = iterator.next();
            p++;
        }
        return w;        
    }
}

class Solution {
    public int[] intersect(int[] nums1, int[] nums2) {
        int[] a = new int[1001];
        ArrayList<Integer> list = new ArrayList<Integer>();
        for(int i = 0;i<nums1.length;i++){
            a[nums1[i]]+=1;
        }
        for(int i = 0;i<nums2.length;i++){
            if(a[nums2[i]]>0){
                list.add(nums2[i]);
                a[nums2[i]]--;
            }
        }
        int[] w = new int[list.size()];
        for(int j = 0;j<w.length;j++){
            w[j] = list.get(j);
        }
        return w;         
    }
}

/** 
 * Forward declaration of guess API.
 * @param  num   your guess
 * @return 	     -1 if num is lower than the guess number
 *			      1 if num is higher than the guess number
 *               otherwise return 0
 * int guess(int num);
 */
 
public class Solution extends GuessGame {
    public int guessNumber(int n) {
        int left = 1;
        int right = n;
        while(left<=right){
            int mid = left+(right-left)/2;
            if(guess(mid)==-1){
                right = mid-1;
            }
            if(guess(mid)==1){
                left = mid+1;
            }
            if(guess(mid)==0){
                return mid;
            }
        } 
        return 0;
    }
}