Single Number @LeetCode

package Level1;

/**
 * Single Number  
 *
 * Given an array of integers, every element appears twice except for one. Find that single one.

Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory 
 */
public class S126 {

	public static void main(String[] args) {
		System.out.println();
	}
	
	// 异或
	public static int singleNumber(int[] A) {
        int res = 0;
        for (int i : A) {
        	res ^= i;
		}
        return res;
    }

}