From a2c790e490af2bdbdca74682c28f7139a5e0c8c2 Mon Sep 17 00:00:00 2001
From: Sonic0588 <sonic050288@gmail.com>
Date: Tue, 18 Aug 2020 16:26:37 +0300
Subject: [PATCH] done

---
 strings/min_cost_string_conversion.py | 8 ++++++--
 1 file changed, 6 insertions(+), 2 deletions(-)

diff --git a/strings/min_cost_string_conversion.py b/strings/min_cost_string_conversion.py
index 34b42f3f0..45500cb54 100644
--- a/strings/min_cost_string_conversion.py
+++ b/strings/min_cost_string_conversion.py
@@ -1,3 +1,5 @@
+from typing import List, Tuple
+
 """
 Algorithm for calculating the most cost-efficient sequence for converting one string
 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)
     Y = list(Y)
     m = len(X)
@@ -46,7 +50,7 @@ def compute_transform_tables(X, Y, cC, cR, cD, cI):
     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:
         seq = []
         return seq