mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-25 10:28:39 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix review issues

Browse Source
This commit is contained in:
MaximSmolskiy 2023-08-14 17:12:24 +03:00
parent 31764fa82a
commit c4c0fafe51
1 changed files with 5 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
boolean_algebra/quine_mc_cluskey.py
View File

@ -74,10 +74,7 @@ def is_for_table(string1: str, string2: str, count: int) -> bool:
""" """
list1 = list(string1) list1 = list(string1)
list2 = list(string2) list2 = list(string2)
count_n = 0 count_n = sum(item1 != item2 for item1, item2 in zip(list1, list2))
for item1, item2 in zip(list1, list2):
if item1 != item2:
count_n += 1
return count_n == count return count_n == count
@ -115,11 +112,11 @@ def selection(chart: list[list[int]], prime_implicants: list[str]) -> list[str]:
temp.append(prime_implicants[rem]) temp.append(prime_implicants[rem])
for i in range(len(chart[0])): for j in range(len(chart[0])):
if chart[rem][i] != 1: if chart[rem][j] != 1:
continue continue
for j in range(len(chart)): for i in range(len(chart)):
chart[j][i] = 0 chart[i][j] = 0
def prime_implicant_chart( def prime_implicant_chart(