LeetCode 136: Single Number

来源:互联网 发布:d3.js调用百度地图api 编辑:程序博客网 时间:2024/06/05 02:34

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

此题和389题如出一辙:
如果存在相同的数,异或一定会为0,剩下的就是那个单数

int singleNumber(int* nums, int numsSize) {    int i, single = 0;    for(i = 0; i < numsSize; ++i)        single ^= nums[i];    return single;}
0 0
原创粉丝点击