improve "see for details" lines & fix spacing

Author: Yrahcaz7

exercises/practice/roman-numerals/.approaches/introduction.md

@@ -51,7 +51,7 @@ def roman(number: int) -> str:
     return res
 ```
 
-See [`if-else`][if-else] for details.
+See the [`if-else`][if-else] approach for details.
 
 ### With table lookup
 
@@ -68,7 +68,7 @@ def roman(number):
     digits = [int(d) for d in str(number)]
 
     # get the row in the lookup table for the most-significant decimal digit
-    inverter = len(digits) - 1 
+    inverter = len(digits) - 1
 
     # translate decimal digits list to Roman numerals list
     roman_digits = [table[inverter - i][d - 1] for i, d in enumerate(digits) if d != 0]
@@ -77,7 +77,7 @@ def roman(number):
     return ''.join(roman_digits)
 ```
 
-See [`table-lookup`][table-lookup] for details.
+See the [`table-lookup`][table-lookup] approach for details.
 
 
 ## Loop over Romans approaches
@@ -101,15 +101,15 @@ def roman(number: int) -> str:
     result = ''
     while number:
         for arabic in ROMAN.keys():
-            if number >= arabic: 
+            if number >= arabic:
                 result += ROMAN[arabic]
                 number -= arabic
                 break
     return result
 ```
 
 There are a number of variants.
-See [`loop-over-romans`][loop-over-romans] for details.
+See the [`loop-over-romans`][loop-over-romans] approach for details.
 
 ## Other approaches
 
@@ -163,7 +163,7 @@ def roman_recur(num: int, idx: int, digits: list[str]):
             return roman_recur(num, idx + 1, digits)
 ```
 
-See  [`recurse-match`][recurse-match] for details.
+See the [`recurse-match`][recurse-match] approach for details.
 
 
 ### Over-use a functional approach

exercises/practice/roman-numerals/.approaches/itertools-starmap/content.md

@@ -4,7 +4,7 @@
 from itertools import starmap
 
 def roman(number: int) -> str:
-    orders = [(1000, 'M  '), (100, 'CDM'), (10, 'XLC'), (1, 'IVX')] 
+    orders = [(1000, 'M  '), (100, 'CDM'), (10, 'XLC'), (1, 'IVX')]
     options = lambda I, V, X: ['', I, I * 2, I * 3, I + V, V, V + I, V + I * 2, V + I * 3, I + X]
     compute = lambda n, chars: options(*chars)[number % (n * 10) // n]
     return ''.join(starmap(compute, orders))

exercises/practice/roman-numerals/.approaches/loop-over-romans/content.md

@@ -9,7 +9,7 @@ def roman(number: int) -> str:
     result = ''
     while number:
         for arabic in ROMAN.keys():
-            if number >= arabic: 
+            if number >= arabic:
                 result += ROMAN[arabic]
                 number -= arabic
                 break
@@ -38,7 +38,7 @@ def roman(number: int) -> str:
 Using a pair of lists is also possible, with a shared index from `enumerate()`.
 
 ```python
-# Use a translation 
+# Use a translation
 numbers = [1000, 900, 500, 400, 100,  90, 50,  40,  10,  9,  5,    4,   1]
 names   = [ 'M', 'CM','D','CD', 'C','XC','L','XL', 'X','IX','V','IV', 'I']
 

exercises/practice/roman-numerals/.approaches/table-lookup/content.md

@@ -13,7 +13,7 @@ def roman(number):
     digits = [int(d) for d in str(number)]
 
     # get the row in the lookup table for the most-significant decimal digit
-    inverter = len(digits) - 1 
+    inverter = len(digits) - 1
 
     # translate decimal digits list to Roman numerals list
     roman_digits = [table[inverter - i][d - 1] for i, d in enumerate(digits) if d != 0]