Re: Deleting substrings
- From: "goose" <ruse@xxxxxxxxxxxxx>
- Date: 29 Jun 2006 06:12:53 -0700
Chris Dollin wrote:
goose wrote:
<snipped>
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?
Er. Requirements error :-) ?
[If not, then we just need to restart the scan not from where we
left off, but from a "suitable distance" before then.]
<speculation>
Would probably be faster to keep it the same (start off where
we stopped) and wrap *that* into a loop which only ends when
no changes are made in the inner loop rather than repeatedly
starting from the beginning of the haystack[1] again (for
arbitrarily long needles[1] "suitable distance" would initially
mean starting from the beginning) each time we make a change.
[1] I use Haystack to mean the long string to be searched and
Needle to mean the short string to find.
Chris "as many cases as corners" Dollin
goose,
"cutting as many corners as there are cases" :-)
.
- Follow-Ups:
- Re: Deleting substrings
- From: ophidian
- Re: Deleting substrings
- References:
- Deleting substrings
- From: Ravi
- Re: Deleting substrings
- From: goose
- Re: Deleting substrings
- From: Chris Dollin
- Deleting substrings
- Prev by Date: Re: Use of semaphores
- Next by Date: Re: ls lacking a feature?
- Previous by thread: Re: Deleting substrings
- Next by thread: Re: Deleting substrings
- Index(es):
Relevant Pages
|
|