从一万个数中找到刚拿掉的数的算法

public class XorTest {   
    public static void main(String[] args) {   
        int[] a = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };   
        int[] b = { 1, 2, 3, 4, 5, 6, 7, 8, 9,10};   
        System.out.println(xorArray(a, b));   

    }   

    public static int xorArray(int[]... ias) {
        int result = 0;   
        for (int i = 0; i < ias.length; i++) {   
            result ^= xorArray(ias[i]);   
        }   
        return result;   
    }   

    public static int xorArray(int[] ia) {   
        int result = 0;   
        for (int i = 0; i < ia.length; i++) {   
            result ^= ia[i];   
            System.out.println(ia[i]);
        }   
        return result;   
    }   
}