mirror of
https://github.com/TheAlgorithms/Python.git
synced 2026-03-13 09:50:19 +08:00
pre-commit autoupdate: pyupgrade v2.34.0 -> v2.37.0 (#6245)
* pre-commit autoupdate: pyupgrade v2.34.0 -> v2.37.0 * pre-commit run --all-files
This commit is contained in:
@@ -11,8 +11,8 @@ References:
|
||||
- https://en.wikipedia.org/wiki/Prime_number
|
||||
"""
|
||||
import math
|
||||
from collections.abc import Iterator
|
||||
from itertools import takewhile
|
||||
from typing import Iterator
|
||||
|
||||
|
||||
def is_prime(number: int) -> bool:
|
||||
|
||||
@@ -23,7 +23,7 @@ The 12th term, F12, is the first term to contain three digits.
|
||||
What is the index of the first term in the Fibonacci sequence to contain 1000
|
||||
digits?
|
||||
"""
|
||||
from typing import Generator
|
||||
from collections.abc import Generator
|
||||
|
||||
|
||||
def fibonacci_generator() -> Generator[int, None, None]:
|
||||
|
||||
@@ -43,7 +43,8 @@ Find the sum of FITs for the BOPs.
|
||||
"""
|
||||
from __future__ import annotations
|
||||
|
||||
from typing import Callable, Union
|
||||
from collections.abc import Callable
|
||||
from typing import Union
|
||||
|
||||
Matrix = list[list[Union[float, int]]]
|
||||
|
||||
|
||||
@@ -30,7 +30,7 @@ Solution:
|
||||
from __future__ import annotations
|
||||
|
||||
import os
|
||||
from typing import Mapping
|
||||
from collections.abc import Mapping
|
||||
|
||||
EdgeT = tuple[int, int]
|
||||
|
||||
|
||||
@@ -39,7 +39,7 @@ So it could be simplified as,
|
||||
"""
|
||||
from __future__ import annotations
|
||||
|
||||
from typing import Generator
|
||||
from collections.abc import Generator
|
||||
|
||||
|
||||
def sieve() -> Generator[int, None, None]:
|
||||
|
||||
Reference in New Issue
Block a user