in reply to
Re: Golf for unique digits
in 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.
A Programming Language, 1962
Programming the 1900 series in COBOL, 1974
Algorithms + Data Structures = Programs, 1976
The C Programming Language, 1978
System V - Interface definition, 1986
Z80 Assembly Language Programming, 1979
TheSOURCE User's Manual, 1979
The C Primer, 1983
Interactive Fortran 77, A Hands on Approach, 1984
Perl.1 man page, 1991
Results (349 votes),