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

Replace bandit, flake8, isort, and pyupgrade with ruff (#8178)

Browse Source 
* Replace bandit, flake8, isort, and pyupgrade with ruff

* Comment on ruff rules

* updating DIRECTORY.md

---------

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
This commit is contained in:
Christian Clauss
2023-03-15 13:58:25 +01:00
committed by GitHub
parent adc3ccdabe
commit c96241b5a5
21 changed files with 127 additions and 132 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
project_euler/problem_075/sol1.py
View File

@ -29,7 +29,6 @@ Reference: https://en.wikipedia.org/wiki/Pythagorean_triple#Generating_a_triple
from collections import defaultdict
from math import gcd
from typing import DefaultDict
def solution(limit: int = 1500000) -> int:
@ -43,7 +42,7 @@ def solution(limit: int = 1500000) -> int:
>>> solution(50000)
5502
"""
frequencies: DefaultDict = defaultdict(int)
frequencies: defaultdict = defaultdict(int)
euclid_m = 2
while 2 * euclid_m * (euclid_m + 1) <= limit:
for euclid_n in range((euclid_m % 2) + 1, euclid_m, 2):