LeetCode 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?

public class Solution {
    public int singleNumber(int[] nums) {
        int result = 0;
        for(int i = 0 ; i<nums.length ; i++ ){
            result ^= nums[i];
        }
        return result;
    }
}

/*************************************************************************
    > File Name: LeetCode136.c
    > Author: Juntaran
    > Mail: JuntaranMail@gmail.com
    > Created Time: Tue 10 May 2016 07:37:54 PM CST
 ************************************************************************/
 
/*************************************************************************
    
    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?

    Subscribe to see which companies asked this question

 ************************************************************************/

#include <stdio.h>

int singleNumber( int* nums, int numsSize )
{
    int ret = 0;
    
    int i;
    for( i=0; i<numsSize; i++ )
    {
        ret ^= nums[i];
    }
    return ret;
}

int main()
{
    int nums[] = { 1, 2, 3, 3, 1 };
    int numsSize = 5;
    int ret = singleNumber( nums, numsSize );
    printf("%d
", ret);

    return 0;
}