FilesExpand file tree

 master

/

SingleNumberWithXor.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

41 lines (20 loc) · 833 Bytes

 master

/

SingleNumberWithXor.java

Copy path

Top

File metadata and controls

• Code
• Blame

41 lines (20 loc) · 833 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

//136. Single Number My Submissions Question

//Total Accepted: 119993 Total Submissions: 244257 Difficulty: Medium

//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 len=nums.length;

if(len == 0)

return 0;

int i,j;

int val=0;

for(i=0;i<len;i++)

{

val=val ^ nums[i];

}

return val;

}

}