LeetCode Single Number

https://oj.leetcode.com/problems/single-number/

水题，直接贴代码。。。

public class Solution {
	public int singleNumber(int [] A){
		Arrays.sort(A);
		int n = A.length;
		for(int i=0;i<n-1;i+=2){
			if(A[i]!=A[i+1]){
				return A[i];
			}
		}
		return A[n-1];
	}
}