Leetcode -- single number (find the number that appears only once in the array)

Problem:

Given an array of integers, every element appearsTwiceCould t for one. Find that single one.

Note:
Your algorithm shocould have a linear runtime complexity. cocould you implement it without using extra memory?

 

Analysis:

The number in the array appears only once, and the number appears twice,

To find the number that appears only once, we can use XOR,

The Code is as follows:

Public class solution {public int singlenumber (INT [] A) {int result = A [0]; for (INT I = 1; I <. length; I ++) {result ^ = A [I];} return result ;}}

Leetcode -- single number (find the number that appears only once in the array)