第10题:
void swap(int a[],int m,int n)
{
int iTemp;
const int Max=m+n;
for(int i=0;i<m;++i){
iTemp=a[0];
for(int j=1;j<Max;++j)
a[j-1]=a[j];
a[Max-1]=iTemp;
}
}
第11题:
#include<iostream>
#include<cstring>
using namespace std;
int squeeze(char s[],const char s2[])
{
int iCount=0;
for(int i=0;s2[i]!='/0';++i){
for(int j=0;s[j]!='/0';++j){
if(s[j]==s2[i]){
++iCount;
for(int n=j;s[n]!='/0';++n)
s[n]=s[n+1];//including '/0', would be move forward
}
}
}
return iCount;
}
int main()
{
char s1[10]="faweioawe";
char s2[7]="ecaobb";
int iCount=squeeze(s1,s2);
for(int i=0;s1[i]!='/0';++i)
cout<<s1[i];
cout<<endl;
cout<<iCount<<endl;
return 0;
}
void swap(int a[],int m,int n)
{
int iTemp;
const int Max=m+n;
for(int i=0;i<m;++i){
iTemp=a[0];
for(int j=1;j<Max;++j)
a[j-1]=a[j];
a[Max-1]=iTemp;
}
}
第11题:
#include<iostream>
#include<cstring>
using namespace std;
int squeeze(char s[],const char s2[])
{
int iCount=0;
for(int i=0;s2[i]!='/0';++i){
for(int j=0;s[j]!='/0';++j){
if(s[j]==s2[i]){
++iCount;
for(int n=j;s[n]!='/0';++n)
s[n]=s[n+1];//including '/0', would be move forward
}
}
}
return iCount;
}
int main()
{
char s1[10]="faweioawe";
char s2[7]="ecaobb";
int iCount=squeeze(s1,s2);
for(int i=0;s1[i]!='/0';++i)
cout<<s1[i];
cout<<endl;
cout<<iCount<<endl;
return 0;
}