首页 > 代码库 > [LeetCode] Single Number
[LeetCode] 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?
异或即可处理,而且,不仅能处理两次的情况,只要出现偶数次,都可以清零。
1 class Solution { 2 public: 3 int singleNumber(int A[], int n) { 4 5 int res = 0; 6 7 for(int i = 0; i<n; i++) 8 { 9 res = res ^ A[i];10 }11 12 return res;13 }14 };
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。