Leetcode:single number

These days to find an internship is too strong, starting from today, the cultivation algorithm. In Leetcode looking for half a day, only this problem will, handy ac off.

Title Description: There is an array, the number of the inside is almost all paired, but there is only one number, your task is to find out the number of the individual.

Idea: Bitwise XOR or directly.

Stick to the code, it's very simple.

public class Solution {public    int singlenumber (int[] A) {for        (int i=1; i < a.length; i++) {            a[0]^=a[i];
  }        return a[0];}    }

By the way, put a code that does not use the temporary variable's swap function:

A^=b^=a^=b

Leetcode:single number