Beefy Boxes and Bandwidth Generously Provided by pair Networks
more useful options
 
PerlMonks  

Re^3: Tree Structure Challenge

by LanX (Cardinal)
on Nov 30, 2015 at 20:53 UTC ( #1148961=note: print w/replies, xml ) Need Help??


in reply to Re^2: Tree Structure Challenge
in thread Tree Structure Challenge

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!

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,

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1148961]
help
Chatterbox?
and the web crawler heard nothing...

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?
    My favourite web site is:












    Results (291 votes). Check out past polls.

    Notices?