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?
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?
![Java小案例——随機數猜測随機數猜測[圖]](data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=)