2025-01-16 23:14:50 +00:00
|
|
|
"""
|
|
|
|
MIT License
|
|
|
|
|
|
|
|
Copyright (c) 2024 yuhari
|
|
|
|
|
|
|
|
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
|
|
of this software and associated documentation files (the "Software"), to deal
|
|
|
|
in the Software without restriction, including without limitation the rights
|
|
|
|
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
|
|
copies of the Software, and to permit persons to whom the Software is
|
|
|
|
furnished to do so, subject to the following conditions:
|
|
|
|
|
|
|
|
The above copyright notice and this permission notice shall be included in all
|
|
|
|
copies or substantial portions of the Software.
|
|
|
|
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
|
|
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
|
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
|
|
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
|
|
SOFTWARE.
|
|
|
|
"""
|
|
|
|
|
2025-01-17 08:52:58 +00:00
|
|
|
"""
|
|
|
|
Reference: https://gist.github.com/harigro/28df9ec639f74f217473f85065acf9d8
|
|
|
|
"""
|
2025-01-16 23:14:50 +00:00
|
|
|
|
|
|
|
|
2025-01-17 08:32:58 +00:00
|
|
|
def divide_array_to_graph(arr: list[int], base: int) -> dict[int, list[int]]:
|
2025-01-16 23:14:50 +00:00
|
|
|
"""
|
2025-01-17 08:32:58 +00:00
|
|
|
>>> divide_array_to_graph(arr=[1, 2, 3, 4, 5, 6, 7, 8], base=2)
|
|
|
|
{0: [1, 2], 1: [3, 4], 2: [5, 6], 3: [7, 8]}
|
|
|
|
>>> divide_array_to_graph(arr=[1, 2, 3, 4, 5, 6, 7, 8], base=3)
|
|
|
|
{0: [1, 2, 3, 4], 1: [5, 6, 7, 8]}
|
2025-01-16 23:14:50 +00:00
|
|
|
"""
|
|
|
|
length = len(arr)
|
2025-01-17 08:32:58 +00:00
|
|
|
parts = len(arr) // base # Desired number of parts
|
2025-01-16 23:14:50 +00:00
|
|
|
part_size = length // parts # Size of each part
|
2025-01-17 08:32:58 +00:00
|
|
|
|
2025-01-16 23:14:50 +00:00
|
|
|
# Divide the array into smaller parts
|
2025-01-17 08:32:58 +00:00
|
|
|
result = [arr[i * part_size : (i + 1) * part_size] for i in range(parts)]
|
|
|
|
|
2025-01-16 23:14:50 +00:00
|
|
|
# Insert the result into a dictionary with keys from 0 to 3
|
|
|
|
result_dict = {i: result[i] for i in range(parts)}
|
2025-01-17 08:32:58 +00:00
|
|
|
|
2025-01-16 23:14:50 +00:00
|
|
|
return result_dict
|
|
|
|
|
2025-01-17 08:32:58 +00:00
|
|
|
|
2025-01-16 23:14:50 +00:00
|
|
|
if __name__ == "__main__":
|
|
|
|
# Example usage
|
|
|
|
array = [1, 2, 3, 4, 5, 6, 7, 8]
|
|
|
|
print(divide_array_to_graph(array, 2))
|
2025-01-17 08:32:58 +00:00
|
|
|
|
2025-01-16 23:14:50 +00:00
|
|
|
import doctest
|
2025-01-17 08:32:58 +00:00
|
|
|
|
|
|
|
doctest.testmod()
|