落单的数

思路：按位异或

public class Solution {
	/**
	 *@param A : an integer array
	 *return : a integer 
	 */
	public int singleNumber(int[] A) {
		if (A.length == 0) {
			return 0;
		}

		int n = A[0];
		for(int i = 1; i < A.length; i++) {
			n = n ^ A[i];
		}
		return n;
	}
	public static void main(String args[]){
		int[] a={1,1,2,3,3};
		Solution t=new Solution();
		int res=t.singleNumber(a);
		System.out.println(res);
	}
}