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?
0和2个相同的数异或等于0
1 int singleNumber(int* nums, int numsSize) { 2 int flag = 0; 3 int i; 4 for(i = 0; i < numsSize; i++) 5 flag ^= nums[i]; 6 return flag; 7 }
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步