[LeetCode] 136. Single Number java

“`
/**136. Single Number
* @param nums
* @return
*/
public int singleNumber(int[] nums) {
Arrays.sort(nums);
if (nums.length == 1) {
return nums[0];
}
for (int i = 1; i < nums.length; i ++) {
if (nums[i] == nums[–i]) {
i = i +2;
}
else {
return nums[i];
}
}
return 0;
}