Commit 6e24935

pre-commit-ci[bot]cclauss

and

authored

[pre-commit.ci] pre-commit autoupdate (#12234)

* [pre-commit.ci] pre-commit autoupdate updates: - [github.com/astral-sh/ruff-pre-commit: v0.6.9 → v0.7.0](astral-sh/ruff-pre-commit@v0.6.9...v0.7.0) - [github.com/tox-dev/pyproject-fmt: 2.3.0 → 2.4.3](tox-dev/pyproject-fmt@2.3.0...2.4.3) - [github.com/abravalheri/validate-pyproject: v0.20.2 → v0.21](abravalheri/validate-pyproject@v0.20.2...v0.21) - [github.com/pre-commit/mirrors-mypy: v1.11.2 → v1.12.1](pre-commit/mirrors-mypy@v1.11.2...v1.12.1) * project_euler/problem_047/sol1.py: def solution(n: int = 4) -> int | None: * Update sol1.py --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com> Co-authored-by: Christian Clauss <cclauss@me.com>

1 parent 03a4251 commit 6e24935Copy full SHA for 6e24935

File tree

2 files changed

+10

-10

lines changed

.pre-commit-config.yaml
project_euler/problem_047
- sol1.py

2 files changed

+10

-10

lines changed

`‎.pre-commit-config.yaml`

Lines changed: 4 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -16,7 +16,7 @@ repos:`
`16`	`16`	`- id: auto-walrus`
`17`	`17`
`18`	`18`	`- repo: https://github.com/astral-sh/ruff-pre-commit`
`19`		`- rev: v0.6.9`
	`19`	`+ rev: v0.7.0`
`20`	`20`	`hooks:`
`21`	`21`	`- id: ruff`
`22`	`22`	`- id: ruff-format`
`@@ -29,7 +29,7 @@ repos:`
`29`	`29`	`- tomli`
`30`	`30`
`31`	`31`	`- repo: https://github.com/tox-dev/pyproject-fmt`
`32`		`- rev: "2.3.0"`
	`32`	`+ rev: "2.4.3"`
`33`	`33`	`hooks:`
`34`	`34`	`- id: pyproject-fmt`
`35`	`35`
`@@ -42,12 +42,12 @@ repos:`
`42`	`42`	`pass_filenames: false`
`43`	`43`
`44`	`44`	`- repo: https://github.com/abravalheri/validate-pyproject`
`45`		`- rev: v0.20.2`
	`45`	`+ rev: v0.21`
`46`	`46`	`hooks:`
`47`	`47`	`- id: validate-pyproject`
`48`	`48`
`49`	`49`	`- repo: https://github.com/pre-commit/mirrors-mypy`
`50`		`- rev: v1.11.2`
	`50`	`+ rev: v1.12.1`
`51`	`51`	`hooks:`
`52`	`52`	`- id: mypy`
`53`	`53`	`args:`

`‎project_euler/problem_047/sol1.py`

Lines changed: 6 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -24,7 +24,7 @@`
`24`	`24`	`def unique_prime_factors(n: int) -> set:`
`25`	`25`	`"""`
`26`	`26`	`Find unique prime factors of an integer.`
`27`		`- Tests include sorting because only the set really matters,`
	`27`	`+ Tests include sorting because only the set matters,`
`28`	`28`	`not the order in which it is produced.`
`29`	`29`	`>>> sorted(set(unique_prime_factors(14)))`
`30`	`30`	`[2, 7]`
`@@ -58,7 +58,7 @@ def upf_len(num: int) -> int:`
`58`	`58`
`59`	`59`	`def equality(iterable: list) -> bool:`
`60`	`60`	`"""`
`61`		`- Check equality of ALL elements in an iterable`
	`61`	`+ Check the equality of ALL elements in an iterable`
`62`	`62`	`>>> equality([1, 2, 3, 4])`
`63`	`63`	`False`
`64`	`64`	`>>> equality([2, 2, 2, 2])`
`@@ -69,23 +69,23 @@ def equality(iterable: list) -> bool:`
`69`	`69`	`return len(set(iterable)) in (0, 1)`
`70`	`70`
`71`	`71`
`72`		`-def run(n: int) -> list:`
	`72`	`+def run(n: int) -> list[int]:`
`73`	`73`	`"""`
`74`	`74`	`Runs core process to find problem solution.`
`75`	`75`	`>>> run(3)`
`76`	`76`	`[644, 645, 646]`
`77`	`77`	`"""`
`78`	`78`
`79`	`79`	`# Incrementor variable for our group list comprehension.`
`80`		`- # This serves as the first number in each list of values`
	`80`	`+ # This is the first number in each list of values`
`81`	`81`	`# to test.`
`82`	`82`	`base = 2`
`83`	`83`
`84`	`84`	`while True:`
`85`	`85`	`# Increment each value of a generated range`
`86`	`86`	`group = [base + i for i in range(n)]`
`87`	`87`
`88`		`- # Run elements through out unique_prime_factors function`
	`88`	`+ # Run elements through the unique_prime_factors function`
`89`	`89`	`# Append our target number to the end.`
`90`	`90`	`checker = [upf_len(x) for x in group]`
`91`	`91`	`checker.append(n)`
`@@ -98,7 +98,7 @@ def run(n: int) -> list:`
`98`	`98`	`base += 1`
`99`	`99`
`100`	`100`
`101`		`-def solution(n: int = 4) -> int:`
	`101`	`+def solution(n: int = 4) -> int\|None:`
`102`	`102`	`"""Return the first value of the first four consecutive integers to have four`
`103`	`103`	`distinct prime factors each.`
`104`	`104`	`>>> solution()`

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Uh oh!

Commit 6e24935

File tree

2 files changed

2 files changed

`‎.pre-commit-config.yaml`

`‎project_euler/problem_047/sol1.py`

0 commit comments