forked from DmrfCoder/AlgorithmAndDataStructure
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path27.py
40 lines (34 loc) · 984 Bytes
/
27.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
# -*- coding:utf-8 -*-
class Solution:
def MoreThanHalfNum_Solution(self, numbers):
# write code here
if numbers is None:
return 0
size = len(numbers)
if size == 0:
return 0
if size == 1:
return numbers
soldier = numbers[0]
soldierCount = 1
soldierIndex = 0
flag = False
for i in range(1, size):
if numbers[i] != soldier:
soldierCount -= 1
if soldierCount == 0:
soldierIndex += 1
soldier = numbers[soldierIndex]
soldierCount = 1
flag = False
else:
flag = True
soldierCount += 1
if soldierCount > 1:
return soldier
elif soldierCount == 1 and flag:
return soldier
else:
return 0
s = Solution()
print s.MoreThanHalfNum_Solution([1])