mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-23 21:11:08 +00:00
35 lines
1.3 KiB
Python
35 lines
1.3 KiB
Python
|
def alternative_list_arrange(first_input_list: list, second_input_list: list) -> list:
|
||
|
|
"""
|
||
|
|
The method arranges two lists as one list in alternative forms of the list elements.
|
||
|
|
:param first_input_list:
|
||
|
|
:param second_input_list:
|
||
|
|
:return: List
|
||
|
|
>>> alternative_list_arrange([1, 2, 3, 4, 5], ["A", "B", "C"])
|
||
|
|
[1, 'A', 2, 'B', 3, 'C', 4, 5]
|
||
|
|
>>> alternative_list_arrange(["A", "B", "C"], [1, 2, 3, 4, 5])
|
||
|
|
['A', 1, 'B', 2, 'C', 3, 4, 5]
|
||
|
|
>>> alternative_list_arrange(["X", "Y", "Z"], [9, 8, 7, 6])
|
||
|
|
['X', 9, 'Y', 8, 'Z', 7, 6]
|
||
|
|
>>> alternative_list_arrange([1, 2, 3, 4, 5], [])
|
||
|
|
[1, 2, 3, 4, 5]
|
||
|
|
"""
|
||
|
|
first_input_list_length: int = len(first_input_list)
|
||
|
|
second_input_list_length: int = len(second_input_list)
|
||
|
|
abs_length: int = (
|
||
|
|
first_input_list_length
|
||
|
|
if first_input_list_length > second_input_list_length
|
||
|
|
else second_input_list_length
|
||
|
|
)
|
||
|
|
output_result_list: list = []
|
||
|
|
for char_count in range(abs_length):
|
||
|
|
if char_count < first_input_list_length:
|
||
|
|
output_result_list.append(first_input_list[char_count])
|
||
|
|
if char_count < second_input_list_length:
|
||
|
|
output_result_list.append(second_input_list[char_count])
|
||
|
|
|
||
|
|
return output_result_list
|
||
|
|
|
||
|
|
|
||
|
|
if __name__ == "__main__":
|
||
|
|
print(alternative_list_arrange(["A", "B", "C"], [1, 2, 3, 4, 5]), end=" ")
|