FilesExpand file tree

 master

/

single_number.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

19 lines (16 loc) · 362 Bytes

 master

/

single_number.py

Copy path

Top

File metadata and controls

• Code
• Blame

19 lines (16 loc) · 362 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

"""

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?

"""

def single_number(nums):

"""

:type nums: List[int]

:rtype: int

"""

i = 0

for num in nums:

i ^= num

return i