leetcode 260.Single Number

题目链接:https://leetcode.com/problems/single-number-iii/
题目:
Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.

For example:

Given nums = [1, 2, 1, 3, 2, 5], return [3, 5].
Note:

1.The order of the result is not important. So in the above example, [5, 3] is also correct.
2.Your algorithm should run in linear runtime complexity. Could you implement it using only constant space complexity?

题目意思:每一个数都有一个和自己搭配的数字，从中找出两个是独立的数字。
思路:这道题的又是找相同的数字，我们一样的看见两个成对的相同的数字的时候我们应该使用异或，首先我们使用排序把所有的从小到大的排好，这样相同的数字就变成相邻了，这样我们每次取这个数和这个数的下一个数，如果想异或等于0直接i+=2,如果不是就把当前值加入数组。
代码如下:

public class Solution {
    public int[] singleNumber(int[] nums) {
        int[] array=new int[2];
        int j=0;
        int N=nums.length;
        Arrays.sort(nums);
        for(int i=0;i<N;){
            if(i+1== N){
                array[j++]=nums[i];
                i++;
            }
            else{
                int re=nums[i]^nums[i+1];
                if(re==0){
                    i+=2;
                }
                else{
                    array[j++]=nums[i];
                    i++;
                }
            }
        }
        return array;
    }
}