mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-04-05 05:16:45 +00:00
Code Issues Packages Projects Releases Wiki Activity

Reduce the complexity of linear_algebra/src/polynom_for_points.py (#7948)

Browse Source 
* updating DIRECTORY.md

* updating DIRECTORY.md

* updating DIRECTORY.md

* Lower the --max-complexity threshold in the file .flake8

* Reduce the complexity of linear_algebra/src/polynom_for_points.py

* Update linear_algebra/src/polynom_for_points.py

Co-authored-by: Christian Clauss <cclauss@me.com>

* Update linear_algebra/src/polynom_for_points.py

Co-authored-by: Christian Clauss <cclauss@me.com>

* Fix

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: Christian Clauss <cclauss@me.com>
This commit is contained in:
Maxim Smolskiy 2022-11-02 21:40:25 +03:00 committed by GitHub
parent 45b3383c39
commit db5215f60e
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
2 changed files with 62 additions and 79 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
.flake8
View File

@ -1,7 +1,7 @@
[flake8] [flake8]
max-line-length = 88 max-line-length = 88
# max-complexity should be 10 # max-complexity should be 10
max-complexity = 23 max-complexity = 21
extend-ignore = extend-ignore =
# Formatting style for `black` # Formatting style for `black`
E203 # Whitespace before ':' E203 # Whitespace before ':'

43
linear_algebra/src/polynom_for_points.py
View File

@ -24,33 +24,21 @@ def points_to_polynomial(coordinates: list[list[int]]) -> str:
>>> print(points_to_polynomial([[1, 5], [2, 2], [3, 9]])) >>> print(points_to_polynomial([[1, 5], [2, 2], [3, 9]]))
f(x)=x^2*5.0+x^1*-18.0+x^0*18.0 f(x)=x^2*5.0+x^1*-18.0+x^0*18.0
""" """
try: if len(coordinates) == 0 or not all(len(pair) == 2 for pair in coordinates):
check = 1 return "The program cannot work out a fitting polynomial."
more_check = 0
d = coordinates[0][0]
for j in range(len(coordinates)):
if j == 0:
continue
if d == coordinates[j][0]:
more_check += 1
solved = "x=" + str(coordinates[j][0])
if more_check == len(coordinates) - 1:
check = 2
break
elif more_check > 0 and more_check != len(coordinates) - 1:
check = 3
else:
check = 1
if len(coordinates) == 1 and coordinates[0][0] == 0: if len({tuple(pair) for pair in coordinates}) != len(coordinates):
check = 2 return "The program cannot work out a fitting polynomial."
solved = "x=0"
except Exception: set_x = {x for x, _ in coordinates}
check = 3 if len(set_x) == 1:
return f"x={coordinates[0][0]}"
if len(set_x) != len(coordinates):
return "The program cannot work out a fitting polynomial."
x = len(coordinates) x = len(coordinates)
if check == 1:
count_of_line = 0 count_of_line = 0
matrix: list[list[float]] = [] matrix: list[list[float]] = []
# put the x and x to the power values in a matrix # put the x and x to the power values in a matrix
@ -102,19 +90,14 @@ def points_to_polynomial(coordinates: list[list[int]]) -> str:
while count < x: while count < x:
remove_e: list[str] = solution[count].split("E") remove_e: list[str] = solution[count].split("E")
if len(remove_e) > 1: if len(remove_e) > 1:
solution[count] = remove_e[0] + "*10^" + remove_e[1] solution[count] = f"{remove_e[0]}*10^{remove_e[1]}"
solved += "x^" + str(x - (count + 1)) + "*" + str(solution[count]) solved += f"x^{x - (count + 1)}*{solution[count]}"
if count + 1 != x: if count + 1 != x:
solved += "+" solved += "+"
count += 1 count += 1
return solved return solved
elif check == 2:
return solved
else:
return "The program cannot work out a fitting polynomial."
if __name__ == "__main__": if __name__ == "__main__":
print(points_to_polynomial([])) print(points_to_polynomial([]))