mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-23 21:11:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

Removed incorrect type hints (#11711)

Browse Source
This commit is contained in:
Sai Aswin Madhavan 2024-10-04 14:58:50 +05:30 committed by GitHub
parent e20b503b24
commit 917ad62105
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 6 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
strings/min_cost_string_conversion.py
View File

@ -21,7 +21,6 @@ def compute_transform_tables(
destination_seq = list(destination_string) destination_seq = list(destination_string)
len_source_seq = len(source_seq) len_source_seq = len(source_seq)
len_destination_seq = len(destination_seq) len_destination_seq = len(destination_seq)
costs = [ costs = [
[0 for _ in range(len_destination_seq + 1)] for _ in range(len_source_seq + 1) [0 for _ in range(len_destination_seq + 1)] for _ in range(len_source_seq + 1)
] ]
@ -31,28 +30,28 @@ def compute_transform_tables(
for i in range(1, len_source_seq + 1): for i in range(1, len_source_seq + 1):
costs[i][0] = i * delete_cost costs[i][0] = i * delete_cost
ops[i][0] = f"D{source_seq[i - 1]:c}" ops[i][0] = f"D{source_seq[i - 1]}"
for i in range(1, len_destination_seq + 1): for i in range(1, len_destination_seq + 1):
costs[0][i] = i * insert_cost costs[0][i] = i * insert_cost
ops[0][i] = f"I{destination_seq[i - 1]:c}" ops[0][i] = f"I{destination_seq[i - 1]}"
for i in range(1, len_source_seq + 1): for i in range(1, len_source_seq + 1):
for j in range(1, len_destination_seq + 1): for j in range(1, len_destination_seq + 1):
if source_seq[i - 1] == destination_seq[j - 1]: if source_seq[i - 1] == destination_seq[j - 1]:
costs[i][j] = costs[i - 1][j - 1] + copy_cost costs[i][j] = costs[i - 1][j - 1] + copy_cost
ops[i][j] = f"C{source_seq[i - 1]:c}" ops[i][j] = f"C{source_seq[i - 1]}"
else: else:
costs[i][j] = costs[i - 1][j - 1] + replace_cost costs[i][j] = costs[i - 1][j - 1] + replace_cost
ops[i][j] = f"R{source_seq[i - 1]:c}" + str(destination_seq[j - 1]) ops[i][j] = f"R{source_seq[i - 1]}" + str(destination_seq[j - 1])
if costs[i - 1][j] + delete_cost < costs[i][j]: if costs[i - 1][j] + delete_cost < costs[i][j]:
costs[i][j] = costs[i - 1][j] + delete_cost costs[i][j] = costs[i - 1][j] + delete_cost
ops[i][j] = f"D{source_seq[i - 1]:c}" ops[i][j] = f"D{source_seq[i - 1]}"
if costs[i][j - 1] + insert_cost < costs[i][j]: if costs[i][j - 1] + insert_cost < costs[i][j]:
costs[i][j] = costs[i][j - 1] + insert_cost costs[i][j] = costs[i][j - 1] + insert_cost
ops[i][j] = f"I{destination_seq[j - 1]:c}" ops[i][j] = f"I{destination_seq[j - 1]}"
return costs, ops return costs, ops