260. Single Number III

题目：https://leetcode.com/problems/single-number-iii/

代码：

public class Solution {    public int[] singleNumber(int[] nums) {        int[] res = new int[2];        Arrays.sort(nums);        for(int i=0;i<nums.length-1;i+=2)        {            if(nums[i]!=nums[i+1])            {                res[0] = nums[i];                break;            }        }        for(int i=0;i<nums.length;i++)        {            if(nums[i]==res[0])                continue;            res[1] ^= nums[i];        }        return res;    }}5ms