字符串常见算法

1  怎样将整型数转化为字符串数，并且不用函数itoa?

 

#include<iostream>
#include <stdio.h>

int main(void)
{
int num=12345,j=0,i=0;
char temp[7],str[7];
while(num)
{temp[i]=num%10+'0';
i++;
num=num/10;
}

temp[i]=0;
printf("temp=%s\n",temp);
i=i-1;
printf(" temp=%d\n",i);
while(i>=0)
{
	str[j]=temp[i];
	j++;
	i--;
}
str[j]=0;
printf("string=%s\n", str);
return 0;
}

2  编程实现字符串数转化成整数的办法

#include<iostream>
#include <stdio.h>

int main(void)
{
int i=0,sum=0;
char temp[7]={'1','2','3','4','5','\0'},str[7];
while(temp[i])
{
sum=sum*10+(temp[i]-'0');
i++;
}

printf(" sum=%d\n",sum);
return 0;

}

3 编程实现函数strcpy，不调用C/C++的字符串库函数

char *strcpy(char *strDest, const char *strSrc)
{
assert((strDest!=NULL)&&(strSrc!=NULL));
char *address=strDest;
while((*strDest++=*strSrc++)!='\0');
return address;
}

4 编写一个函数，作用是把一个char组成的字符串循环右移n个

void LoopMove(char *pStr, int steps)
{
int n=strlen(pStr) - steps;
char tmp[MAX_LEN];
memcpy(tmp, pStr+n,steps);
memcpy(pStr+steps,pStr,n);
memcpy(pstr,tmp,steps);
}

5  将一句话里的单词进行倒置，标点符号不倒换。比如一句话“I love csdn." 倒换后变成"csdn.love I"。

 

#include<iostream>
#include<stdio.h>
using namespace std;

int main(void)
{
int j=0,i=0,flag=0,begin,end;
char str[]="i come from tianjin.",temp;
j=strlen(str)-1;
printf(" string =%s\n", str);
//第一步是进行全盘翻转，将单词变成.nijnait morf emoc i
while(j>i)
{
temp=str[i];
str[i]=str[j];
str[j]=temp;
j--;
i++;
}

printf(" string = %s\n", str);
i=0;
//第二步进行部分翻转，如果不是空格，则开始翻转单词
while(str[i])
{
 if(str[i]!=' ')
  {
    begin=i;
    while(str[i]&&str[i]!=' '){i++;}
	i=i-1;
	end=i;
  }
	while(end>begin)
	{  temp=str[begin];
	   str[begin]=str[end];
	   str[end]=temp;
	   end--;
	   begin++;
    }

i++;
}
printf(" string = %s\n", str);
return 0;

}

 

6 转换字符串格式为原来字符串里的字符+该字符连续出现的个数，例如字符串1444223，转换为11432231(1出现1次，4出现3次，2出现2次.....)

 

#include<iostream>
#include<string>
using namespace std;
int main()
{
cout<<"Enter the numbers "<<endl;
string str;
char reschar[50];
reschar[0]='\0';
cout<<"I am here 1"<<endl;
getline(cin, str);
cout<<"I am here  2"<<endl;
int len=str.length();
cout<<"I am here  3"<<endl;
int count=1;
int k;
for(k=0;k<=len-1;k++)
{
	cout<<"I am here  4"<<endl;
	if((k+1)<len)
		{
		if((str[k+1]==str[k]))
			{
			  cout<<"I am here  51"<<endl;
			  count++;
			}
			else
			{ cout<<"I am here  52"<<endl;
			  sprintf(reschar+strlen(reschar),"%c%d", str[k],count);
			  count=1;
			}
	    }//if((k+1)<len)
	else break;

}
sprintf(reschar+strlen(reschar), "%c%d",str[k],count);
cout<<"I am here 7"<<endl;
cout<<reschar<<"gg"<<endl;
cout<<endl;
return 0;

}

7 编程实现字符串比较函数strcmp(char *src, char *sub)

int str_cmp(char *s1, char *s2)
{
	while((*s1!='\0')|| (*s2!='\0'))
	{

          if(*s1==*s2
		{
                  s1++;
                  s2++;
                 }
          else if(*s1<*s2)
                 {
                   return -1; 
                  }
           else
                return 1;
	}

return 0;

}