Fix type hints issues
This commit is contained in:
parent
d943c32ea3
commit
f8b5260349
@ -30,7 +30,7 @@ from projecteuler import timing
|
||||
|
||||
@timing
|
||||
def p008() -> None:
|
||||
number = '73167176531330624919225119674426574742355349194934' +\
|
||||
_number = '73167176531330624919225119674426574742355349194934' +\
|
||||
'96983520312774506326239578318016984801869478851843' +\
|
||||
'85861560789112949495459501737958331952853208805511' +\
|
||||
'12540698747158523863050715693290963295227443043557' +\
|
||||
@ -51,7 +51,7 @@ def p008() -> None:
|
||||
'71636269561882670428252483600823257530420752963450'
|
||||
|
||||
# Transform the string into a list of integers
|
||||
number = list(map(int, number))
|
||||
number = list(map(int, _number))
|
||||
|
||||
_max = 0
|
||||
|
||||
|
@ -110,7 +110,7 @@ from projecteuler import timing
|
||||
|
||||
@timing
|
||||
def p013() -> None:
|
||||
numbers = [37107287533902102798797998220837590246510135740250,
|
||||
_numbers = [37107287533902102798797998220837590246510135740250,
|
||||
46376937677490009712648124896970078050417018260538,
|
||||
74324986199524741059474233309513058123726617309629,
|
||||
91942213363574161572522430563301811072406154908250,
|
||||
@ -212,7 +212,7 @@ def p013() -> None:
|
||||
53503534226472524250874054075591789781264330331690]
|
||||
|
||||
# Convert the list of numbers in a numpy array and calculate the sum
|
||||
numbers = np.array(numbers)
|
||||
numbers = np.array(_numbers)
|
||||
|
||||
_sum = str(numbers.sum())
|
||||
|
||||
|
@ -42,16 +42,11 @@ def p018() -> None:
|
||||
triang = []
|
||||
|
||||
for line in fp:
|
||||
triang.append(line.strip('\n').split())
|
||||
triang.append(list(map(int, line.strip('\n').split())))
|
||||
except FileNotFoundError:
|
||||
print('Error while opening file p018_triangle.txt')
|
||||
sys.exit(1)
|
||||
|
||||
l = len(triang)
|
||||
|
||||
for i in range(l):
|
||||
triang[i] = list(map(int, triang[i]))
|
||||
|
||||
# Use the function implemented in projecteuler.c to find the maximum path.
|
||||
_max = find_max_path(triang, 15)
|
||||
|
||||
|
Loading…
x
Reference in New Issue
Block a user