"""
Solution for -> Row of the odd triangle.
Created by Egor Kostan.
GitHub: https://github.com/ikostan
"""
[docs]
def odd_row(n: int) -> list:
"""
Odd row.
Given a triangle of consecutive odd numbers
finds the triangle's row knowing its index
(the rows are 1-indexed).
:param n:
:return:
"""
row: list = []
number: int = calc_first_number(n)
last: int = calc_last_number(n)
# pylint: disable-msg=R0801
while number <= last:
row.append(number)
number += 2
return row
[docs]
def calc_first_number(n: int) -> int:
"""
Calculate first number in the row.
:param n:
:return:
"""
return (n * (n - 1)) + 1
[docs]
def calc_last_number(n: int) -> int:
"""
Calculate last number in the row.
:param n:
:return:
"""
return (n * n) + (n - 1)
# pylint: disable-msg=R0801