mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-22 09:12:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

done

Browse Source
This commit is contained in:
Sonic0588 2020-08-18 16:26:37 +03:00
parent 9a32f0b46c
commit a2c790e490
1 changed files with 6 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
strings/min_cost_string_conversion.py
View File

@ -1,3 +1,5 @@
from typing import List, Tuple
""" """
Algorithm for calculating the most cost-efficient sequence for converting one string Algorithm for calculating the most cost-efficient sequence for converting one string
into another. into another.
@ -9,7 +11,9 @@ The only allowed operations are
""" """
def compute_transform_tables(X, Y, cC, cR, cD, cI): def compute_transform_tables(
X: str, Y: str, cC: int, cR: int, cD: int, cI: int
) -> Tuple[List[int], List[str]]:
X = list(X) X = list(X)
Y = list(Y) Y = list(Y)
m = len(X) m = len(X)
@ -46,7 +50,7 @@ def compute_transform_tables(X, Y, cC, cR, cD, cI):
return costs, ops return costs, ops
def assemble_transformation(ops, i, j): def assemble_transformation(ops: List[str], i: int, j: int) -> List[str]:
if i == 0 and j == 0: if i == 0 and j == 0:
seq = [] seq = []
return seq return seq