Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

Re^2: The greedy change-making problem using regexes

by blokhead (Monsignor)
on Mar 10, 2005 at 02:00 UTC ( #438134=note: print w/ replies, xml ) Need Help??


in reply to Re: The greedy change-making problem using regexes
in thread The greedy change-making problem using regexes

Ooh, that is quite elegant indeed. One of my lessons here was "Know in which order thine regex engine tries things" but I completely missed this little optimization. ;) It really matches up temporaly with the spirit of the problem.

I suppose I could also use (?>pattern) to prevent backtracking and perform the greedy match without the negative lookaheads?

(1 x $money) =~ /^(?>(1{10})*)(?>(1{6})*)(?>(1{5})*)(?>(1{1})*)$/
Although I can't say I've ever really used (?>pattern)...

Anyway, the pain in the butt is counting the number of coins. I like my little (?{$^R+1}) idiom!

blokhead


Comment on Re^2: The greedy change-making problem using regexes
Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (7)
As of 2015-08-01 03:02 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (285 votes), past polls