Chris Rebert wrote:
> On Mon, Dec 15, 2008 at 11:06 AM, Reckoner wrote:
>> Hi,
>>
>> I have lists of the following type:
>>
>> [1,2,3,[5,6]]
>>
>> and I want to produce the following strings from this as
>>
>> '0-1-2-3-5'
>> '0-1-2-3-6'
>>
>> That was easy enough. The problem is that these can be
bearophileh...@lycos.com writes:
> I was waiting to answer because so far I have found a bad-looking
> solution only. Seeing there's only your solution, I show mine too. It
> seems similar to your one.
I think that the solution below is a bit clearer, although I think it is
more resource intensiv
On Dec 15, 1:28 pm, Arnaud Delobelle wrote:
> Reckoner writes:
> > Hi,
>
> > I have lists of the following type:
>
> > [1,2,3,[5,6]]
>
> > and I want to produce the following strings from this as
>
> > '0-1-2-3-5'
> > '0-1-2-3-6'
>
> > That was easy enough. The problem is that these can be nested.
On Mon, Dec 15, 2008 at 12:24 PM, Kirk Strauser wrote:
> At 2008-12-15T20:03:14Z, "Chris Rebert" writes:
>
>> You just need a recursive list-flattening function. There are many
>> recipes for these. Here's mine:
>
> flattened = flatten([1,2,3,[5,6,[10, 11]],7,[9,[1, 2, 3, 4, 5 ]]])
> flat
Arnaud Delobelle:
> Here is a not thought out solution:
>...
I was waiting to answer because so far I have found a bad-looking
solution only. Seeing there's only your solution, I show mine too. It
seems similar to your one.
def xflatten(seq):
if isinstance(seq, list):
stack = [iter(se
Kirk Strauser wrote:
At 2008-12-15T19:06:16Z, Reckoner writes:
The problem is that I don't know ahead of time how many lists there are or
how deep they go. In other words, you could have:
Recursion is your friend.
Write a function to unpack one "sublist" and call itself again with the new
l
Reckoner writes:
> Hi,
>
> I have lists of the following type:
>
> [1,2,3,[5,6]]
>
> and I want to produce the following strings from this as
>
> '0-1-2-3-5'
> '0-1-2-3-6'
>
> That was easy enough. The problem is that these can be nested. For
> example:
>
> [1,2,3,[5,6],[7,8,9]]
>
> which should
At 2008-12-15T20:03:14Z, "Chris Rebert" writes:
> You just need a recursive list-flattening function. There are many
> recipes for these. Here's mine:
flattened = flatten([1,2,3,[5,6,[10, 11]],7,[9,[1, 2, 3, 4, 5 ]]])
flattened
> [1, 2, 3, 5, 6, 10, 11, 7, 9, 1, 2, 3, 4, 5]
'-'.jo
At 2008-12-15T19:06:16Z, Reckoner writes:
> The problem is that I don't know ahead of time how many lists there are or
> how deep they go. In other words, you could have:
Recursion is your friend.
Write a function to unpack one "sublist" and call itself again with the new
list. For instance, s
On Mon, Dec 15, 2008 at 11:06 AM, Reckoner wrote:
> Hi,
>
> I have lists of the following type:
>
> [1,2,3,[5,6]]
>
> and I want to produce the following strings from this as
>
> '0-1-2-3-5'
> '0-1-2-3-6'
>
> That was easy enough. The problem is that these can be nested. For
> example:
>
> [1,2,3,
Hi,
I have lists of the following type:
[1,2,3,[5,6]]
and I want to produce the following strings from this as
'0-1-2-3-5'
'0-1-2-3-6'
That was easy enough. The problem is that these can be nested. For
example:
[1,2,3,[5,6],[7,8,9]]
which should produce
'0-1-2-3-5-7'
'0-1-2-3-5-8'
'0-1-2-3-
11 matches
Mail list logo
