136. Single Number A number that only appears once

Given a non-empty array of integers nums, every element appears twice except for one. Find that single one.

Given an array of non-empty integers, each element appears twice except one that appears only once.Find the element that appears only once.

Description:

You must implement a solution with a linear runtime complexity and use only constant extra space.

Your algorithm should have linear time complexity.Can you do it without using extra space?

Example 1:Example 1:

Input: nums = [2,2,1]
Output: 1

Enter: [2,2,1]Output: 1

Example 2:Example 2:

Input: nums = [4,1,2,1,2]
Output: 4

Enter: [4,1,2,1,2]Output: 4

Example 3:

Input: nums = [1]
Output: 1

Constraints:

1 <= nums.length <= 3 *
-3 * <= nums[i] <= 3 *
Each element in thearray appears twice except for one element which appears only once.

C language: (XOR operation)

int singleNumber(int* nums, int numsSize){for(int i=1;i

Execution result: Passed

Execution time: 16 ms, beat 88.61% of users in all C commits

Memory consumption: 7 MB, beats 61.65% of users in all C commits

Passed test case: 61 / 61

C language: (violence law)

int singleNumber(int* nums, int numsSize){int result;for(int i=0;i

Execution result: pass

Execution time: 1020 ms, beats 6.61% of users in all C commits

Memory consumption: 7.1 MB, beats 41.73% of users in all C commits

Passed test case: 61 / 61