algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-19 19:03:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

from __future__ import annotations (#2464)

Browse Source 
* from __future__ import annotations

* fixup! from __future__ import annotations

* fixup! from __future__ import annotations

* fixup! Format Python code with psf/black push

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
This commit is contained in:
Christian Clauss
2020-09-23 13:30:13 +02:00
committed by GitHub
parent 6e6a49d19f
commit 9200a2e543
72 changed files with 275 additions and 250 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
project_euler/problem_37/sol1.py
View File

@ -9,8 +9,7 @@ and right to left.
NOTE: 2, 3, 5, and 7 are not considered to be truncatable primes.
"""
from typing import List
from __future__ import annotations
seive = [True] * 1000001
seive[1] = False
@ -36,7 +35,7 @@ def is_prime(n: int) -> bool:
return seive[n]
def list_truncated_nums(n: int) -> List[int]:
def list_truncated_nums(n: int) -> list[int]:
"""
Returns a list of all left and right truncated numbers of n
>>> list_truncated_nums(927628)
@ -71,7 +70,7 @@ def validate(n: int) -> bool:
return True
def compute_truncated_primes(count: int = 11) -> List[int]:
def compute_truncated_primes(count: int = 11) -> list[int]:
"""
Returns the list of truncated primes
>>> compute_truncated_primes(11)