Leetcode no. 136

136. Single Number

Given an array of integers, every element appears twice except for one. Find that single one.

Note:

Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?

public class Solution {
public int singleNumber(int[] nums) {
int res=0;
for (int ele: nums){
res ^= ele;
}
return res;
}
}