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

Pyupgrade to Python 3.9 (#4718)

Browse Source 
* Pyupgrade to Python 3.9

* updating DIRECTORY.md

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
This commit is contained in:
Christian Clauss
2021-09-07 13:37:03 +02:00
committed by GitHub
parent 5d5831bdd0
commit cecf43d648
142 changed files with 523 additions and 530 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
project_euler/problem_051/sol1.py
View File

@ -15,12 +15,12 @@ with this property.
Find the smallest prime which, by replacing part of the number (not necessarily
adjacent digits) with the same digit, is part of an eight prime value family.
"""
from __future__ import annotations
from collections import Counter
from typing import List
def prime_sieve(n: int) -> List[int]:
def prime_sieve(n: int) -> list[int]:
"""
Sieve of Erotosthenes
Function to return all the prime numbers up to a certain number
@ -52,7 +52,7 @@ def prime_sieve(n: int) -> List[int]:
return primes
def digit_replacements(number: int) -> List[List[int]]:
def digit_replacements(number: int) -> list[list[int]]:
"""
Returns all the possible families of digit replacements in a number which
contains at least one repeating digit