LeetCode 136 Single Number

来源:互联网 发布:淘宝美瞳店铺哪个好 编辑:程序博客网 时间:2024/06/05 00:54

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?

AC代码如下:(位运算的经典应用)

class Solution {public:    int singleNumber(vector<int>& nums) {        int ret=0;        for(int i=0;i<nums.size();i++)            ret^=nums[i];        return ret;    }};


0 0
原创粉丝点击