4.13.txt

数据结构实验 如下： Status Fibonacci(int k, int m, int &f) /* 求k阶斐波那契序列的第m项的值f */

void DelSubString(StringType &scrStr, StringType subStr)
/* Remove all substring matching 'subStr' from 'scrStr'. */
{
    StringType ans,si;
    int i,j,lent;
    InitStr(ans);
    lent=StrLength(subStr);
    for(i=0,j=0;i<StrLength(scrStr);){
        si=SubString(scrStr,i+1,lent);
        if(!StrCompare(si,subStr))
            i+=lent;
        else ans[j++]=scrStr[i++];
    }
    InitStr(scrStr);
    StrAssign(scrStr,ans);
}