in reply to Re: Golf for unique digitsin thread Golf for unique digits
perl -nlE"say 0+s/(.)(?!.*\1)//g"
This seems to work just as well?
perl -nlE"say s/(.)(?!.*\1)//g"
tye++ ... but I'm stuck to understand how it works?
According to perlop:
Searches a string for a pattern, and if found, replaces that pattern with the replacement text and returns the number of substitutions made.
How does the number of substitutions made equate to the number of characters left after the substitutions?
(?!..) = not followed by!
every cipher is exactly once the last of it's kind! =)
Of course! Thanks.
Read a book on Perl
Written a book on Perl
Contributed to the Perl source code
Debugged someone else's script
Played Perl Golf
Used regular expressions to save the day
Used Perl for a certain amount of time (please specify)
Invested a certain amount of man-hours in learning Perl (please estimate)
Visited at least x Perl related events
(Co)maintain at least x active (up-river) CPAN modules
Forgotten you were not Larry Wall
One can never truly know Perl
Results (346 votes). Check out past polls.