-
Notifications
You must be signed in to change notification settings - Fork 7
/
Copy pathMissingNumber.py
42 lines (40 loc) · 1.09 KB
/
MissingNumber.py
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
42
### Python Solution 1:
class Solution:
def missingNumber(self, nums: List[int]) -> int:
res = 0
n = len(nums)
nums_set = set(nums)
for num in range(n+1):
if num not in nums_set:
return num
return res
### Python Solution 2:
# -*- coding:utf-8 -*-
class Solution:
def missingNumber(self, nums: List[int]) -> int:
res = 0;
n = len(nums)
x = range(n+1)
x = list(x) ### Python3 需要用list转换成数组
res = sum(x)-sum(nums)
return res
# -*- coding:utf-8 -*-
class Solution:
def missingNumber(self, nums: List[int]) -> int:
n = len(nums)
res = n
for i in range(n):
res = res ^ nums[i]
res = res ^ i
return res
### Python Solution 3:
# -*- coding:utf-8 -*-
class Solution:
def missingNumber(self, nums: List[int]) -> int:
nums = sorted(nums)
n = len(nums)
if nums[-1] != n:
return n
for i in range(0,n):
if i!=nums[i]:
return i