string question
hi there,
i am trying to get all different possibilites of my string but i get lost when get deep in it.
assume
char *s = "dummy"
but there may be substitutions for specifici characters.
e.g. (u-f) (u-z) (y-w)
so all possible strings are:
dummy dummw
dfmmy dfmmw
dzmmy dzmmw
i thinik algorithm is a recursion.
any suggestions?
Use strchr().
dwk
Seek and ye shall find. quaere et invenies.
"Simplicity does not precede complexity, but follows it." -- Alan Perlis
"Testing can only prove the presence of bugs, not their absence." -- Edsger Dijkstra
"The only real mistake is the one from which we learn nothing." -- John Powell
Other boards: DaniWeb, TPS
Unofficial Wiki FAQ: cpwiki.sf.net
My website: http://dwks.theprogrammingsite.com/
Projects: codeform, xuni, atlantis, nort, etc.
how? i could not get the point
> char *s = "dummy"
Except you can't modify such strings, so you would at least need to start with
char s[] = "dummy";
> how? i could not get the point
strchr() returns a pointer to a char, if it finds the char, or NULL if not.
So
char *p = strchr(s,'m');
Would result in p pointing to the first 'm'
You can then do something like
*p = 'z';
To use strchr() to replace all occurences of a character, you can use a loop:
Code:char *p; while(p = strchr(s, 'a')) *p = 'b';
dwk
Seek and ye shall find. quaere et invenies.
"Simplicity does not precede complexity, but follows it." -- Alan Perlis
"Testing can only prove the presence of bugs, not their absence." -- Edsger Dijkstra
"The only real mistake is the one from which we learn nothing." -- John Powell
Other boards: DaniWeb, TPS
Unofficial Wiki FAQ: cpwiki.sf.net
My website: http://dwks.theprogrammingsite.com/
Projects: codeform, xuni, atlantis, nort, etc.
thanks i see that but there may be more than one substitution so i need a combination or st. like that.
Well what would be quite helpful is for you to make your best attempt at the code. Then, if it is not working the way you want, post it here and we can advise you as necessary.
~/
