Re^3: Tree Structure Challenge

by LanX (Cardinal)

on Nov 30, 2015 at 20:53 UTC ( #1148961=note: print w/replies, xml )

Need Help??

Yes = you want minimal number of operations?

Do the diff arrays need to be ordered?

Cheers Rolf
_{(addicted to the Perl Programming Language and ☆☆☆☆ :)

Je suis Charlie!}

Comment on Re^3: Tree Structure Challenge

Replies are listed 'Best First'.
Re^4: Tree Structure Challenge by choroba (Archbishop) on Nov 30, 2015 at 21:03 UTC
Yes = you don't miss anything. No ordering needed. ($q=q:Sq=~/;[c](.)(.)/;chr(-\|\|-\|5+lengthSq)`"S\|oS2"`map{chr \|+ord }map{substrSq`S_+\|`\|}3E\|-\|`7**2-3:)=~y+S\|`+$1,++print+eval$q,q,a, [download]	[reply] [d/l]

In Section Meditations

Node Status^?

node history
Node Type: note [id://1148961]
help

Chatterbox^?

How do I use this? | Other CB clients

Other Users^?

Others exploiting the Monastery: (3)

As of 2020-11-01 01:32 GMT

Sections^?

Information^?

Find Nodes^?

Leftovers^?

Voting Booth^?

Notices^?