1. Description

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?

2. Runtime Distribution

3. Submission Details

4. Example

Input: 14,14,23,35,23
Ouput: 35

5. Code

[restabs alignment="osc-tabs-right" responsive="true" icon="true" text="More" seltabcolor="#fdfdfd" seltabheadcolor="#000" tabheadcolor="blue"]
[restab title="Java" active="active"]

public int singleNumber(int[] nums) {
	if (nums == null || nums.length == 0) {
		return 0;
	}
	int result = nums[0];
	for (int i = 1; i < nums.length; i++) {
		result ^= nums[i];
	}
	return result;
}

[/restab]
[/restabs]

6.Test

[restabs alignment="osc-tabs-right" responsive="true" icon="true" text="More" seltabcolor="#fdfdfd" seltabheadcolor="#000" tabheadcolor="blue"]
[restab title="Java" active="active" ]

public class LeetCode0136 {
	public int singleNumber(int[] nums) {
		if (nums == null || nums.length == 0) {
			return 0;
		}
		int result = nums[0];
		for (int i = 1; i < nums.length; i++) {
			result ^= nums[i];
		}
		return result;
	}

	public static void main(String[] args) {
		LeetCode0136 leetcode = new LeetCode0136();
		int[] nums = { 14, 14, 23, 35, 23 };
		System.out.println(leetcode.singleNumber(nums));
	}
}

[/restab]
[/restabs]