Re: Deleting substrings
- From: Chris Dollin <chris.dollin@xxxxxx>
- Date: Thu, 29 Jun 2006 10:49:54 +0100
goose wrote:
Ravi wrote:
A function which takes a string and a substring as input and which
deletes the substring in the main string.
Eg: mainstr=abcxyghixy sub=xy
Result should be mainstr=abcghi.
Will it require recursion ?
How to handle the deletion part..I mean deleting a substring and then
starting all over again looking for the next substring.
Well, you don't have to start all over again; you can always
start looking again at the point that you last stopped.
1. We start at the beginning of the string.
abcxyghixy
^
2. We scan from that point for "xy" and if we don't find it
then we are done, if we find it then we are at the following point
in the string:
abcxyghixy
^
3. We copy the characters from the point immediately after
"xy" into the current position:
abcghixy
^
4. We repeat steps 2 and 3 until step 2 tells us that we are done.
Not as a criticism of your solution (I'm just piggybacking), but
I wonder what the OP intends to do with
abcxxyydef
After `delete A from B`, is it allowed for the result to contain A?
[If not, then we just need to restart the scan not from where we
left off, but from a "suitable distance" before then.]
--
Chris "as many cases as corners" Dollin
"Never ask that question!" Ambassador Kosh, /Babylon 5/
.
- Follow-Ups:
- Re: Deleting substrings
- From: goose
- Re: Deleting substrings
- References:
- Deleting substrings
- From: Ravi
- Re: Deleting substrings
- From: goose
- Deleting substrings
- Prev by Date: Re: Merging two sorted arrays in place
- Next by Date: Array elements
- Previous by thread: Re: Deleting substrings
- Next by thread: Re: Deleting substrings
- Index(es):
Relevant Pages
|