string.txt

晕传一个东西居然用这么长时间是不是应该改进一下了现在这个时代谁有那么多的时间去折腾呀

#include <iostream>
using namespace std;
class String 
{
public:
	String ();
	String (char *d1);	
	String (String &d1);
	~String (){};
	int length();
    int find(String s,String t);
	String operator = (String &rh);
    bool operator > (String a1);
    bool operator < (String a2);
	String operator + (String c4);
	friend ostream& operator << (ostream& os,String& p1);
	friend istream& operator >> (istream& is,String& p1);
	char operator [] (int n);
private:
    char *p1;
    int len;
};//类声明
String::String()
{
	len=0;
	p1=new char(len+1);
	p1[0]=0;
}//ok构造函数
String::String(char *d1)
{
	len=strlen(d1);
	p1=new char(len+1);
	strcpy(p1,d1);

}//ok构造函数
String::String(String &d1)
{
	
	len=d1.length();//p1=new char[strlen(d1.p1 )+1];strcpy(p1,d1.p1 );
	p1=new char[len+1];
	strcpy(p1,d1.p1);
}//析构函数
int String::length()
{
	/*
    int sum(0);
	for (int i=0;i<100;i++)
	{
		if(p1[i]!='\0')
			sum++;
	}
	*/
	return len;
}//求长度

int String::find (String s,String t)
{

	int lengthS,lengthT;
	bool check;
	lengthS=s.length();
	lengthT=t.length();
	for (int count=0; count<lengthS; count++)
	{
		check=true;
		for(int count1=0; count1<lengthT && count+count1<=lengthS; count1++)
		{
			if (s[count+count1]!=t[count1])
			{
				check=false;
				break;
			}
		}
		if (check) return count+1; 
	}
	return -1;
}//find函数的实现
String String::operator = (String& rh)
{
	
   p1=new char[rh.len+1];
   len = rh.len;
   for(unsigned short i=0;i<rh.len;i++)
	  p1[i]=rh[i];
	p1[len]='\0'; 
	return *this;         
} 


bool String::operator  > (String a1)
{
	if(strlen(p1)>a1.length())
		cout<<p1<<"is big than"<<a1<<endl;
	return true;
}//大于运算符重载
bool String:: operator < (String a2)
{
	if(strlen(p1)<a2.length())
		cout<<p1<<"is small than"<<a2<<endl;
	return true;
}//小于运算符的重载
 
String String::operator + (String c4)
{
	/*
	 int a;
	char *f1;
	f1=new char [200];
	for(int i=0;i<100;i++)
		f1[i]=p1[i];
	a=c4.length();
	for(int j=0;j<100;j++)
		f1[a+j]=c4.p1[j];
	return f1;
	*/
	 String str;
	str.len = len + c4.len;
	str.p1 = new char[str.len];
	strcpy(str.p1,p1);
	strcat(str.p1,c4.p1);
	return str;
}//加号的重载
ostream& operator << (ostream& os,String& p)
{
	os<<p.p1; 
	return os;
}//输出运算符的重载
istream& operator >> (istream& is,String& p)
{
	char tmp[512];
	is>>tmp;
	p.len= strlen(tmp);
	p.p1 = new char[p.len];
	strcpy(p.p1,tmp);
	return is;
}//输入运算符的重载
char String::operator [] (int n)
{
	return p1[n];
}//下标运算符的重载

int main()
{
	String s1,s2,s3;
	cin>>s1;
	cin>>s2;
	s3=s1+s2;
	cout<<s3<<endl;
	for(int i=0;i<s3.length();i++)
		cout<<s3[i];
	cout<<endl;
	if(s1<s2)
		cout<<s1<<"is more lager than"<<s2<<endl;
   cout<<s3.find(s1,s2);
	return 0;
}//主函数的实现