How can I make my output group all numbers together?-CodePudding

So I'm trying to find how to group similar numbers into different lists. I tried looking at some sources like (Grouping / clustering numbers in Python) but all of them requires the importation of itertools and use itertools.groupby, which I dont want because I dont want to use built in functions.

Here is my code so far.

def n_length_combo(lst, n):
    if n == 0:
        return [[]]

    l = []
    for i in range(0, len(lst)):

        m = lst[i]
        remLst = lst[i   1:]

        for p in n_length_combo(remLst, n - 1):
            l.append([m]   p)

    return l

print(n_length_combo(lst=[1,1,76,45,45,4,5,99,105],n=3))

Edit: n: int represents the number of groups permitted from one single list, so if n is 3, the numbers will be grouped in (x,...), (x,....) (x,...) If n = 2, the numbers will be grouped in (x,..),(x,...)

However, my code prints out all possible combinations in a list of n elements. But it doesnt group the numbers together. So what I want is: for instance if the input is

[10,12,45,47,91,98,99]

and if n = 2, the output would be

[10,12,45,47] [91,98,99]

and if n = 3, the output would be

[10,12] [45,47] [91,98,99]

What changes to my code should I make?

CodePudding user response：

Assuming n is the number of groups/partitions you want:

import math

def partition(nums, n):
    partitions = [[] for _ in range(n)]
    min_, max_ = min(nums), max(nums)
    r = max_ - min_ # range of the numbers
    s = math.ceil(r / n) # size of each bucket/partition
    for num in nums:
        p = (num - min_) // s
        partitions[p].append(num)
    return partitions

nums = [10,12,45,47,91,98,99]

print(partition(nums, 2))
print(partition(nums, 3))

prints:

[[10, 12, 45, 47], [91, 98, 99]]
[[10, 12], [45, 47], [91, 98, 99]]

CodePudding user response：

You are trying to convert a 1d array into a 2d array. Forgive the badly named variables but the general idea is as follows. It is fairly easy to parse, but basically what we are doing is first finding out the size in rows of the 2d matrix given the length of the 1d matrix and desired number of cols. If this does not divide cleanly, we add one to rows. then we create one loop for counting the cols and inside that we create another loop for counting the rows. we map the current position (r,c) of the 2d array to an index into the 1d array. if there is an array index out of bounds, we put 0 (or None or -1 or just do nothing at all), otherwise we copy the value from the 1d array to the 2d array. Well, actually we create a 1d array inside the cols loop which we append to the lst2 array when the loop is finished.

def transform2d(lst, cols):
    size = len(lst)
    
    rows = int(size/cols)
    if cols * rows < size:
        rows =1

    lst2 = []
    for c in range(cols):
        a2 = []
        for r in range(rows):
            i = c*cols   r
            if i < size:
                a2.append(lst[i])
            else:
                a2.append(0)  # default value
        lst2.append(a2)
    return lst2

i = [10,12,45,47,91,98,99]
r = transform2d(i, 2)
print(r)
r = transform2d(i, 3)
print(r)

the output is as you have specified except for printing 0 for the extra elements in the 2d array. this can be changed by just removing the else that does this.