019:全面的MyString

总时间限制: 

1000ms

 

内存限制: 

65536kB

描述

程序填空，输出指定结果

#include <cstdlib>
#include <iostream>
using namespace std;
int strlen(const char * s) 
{	int i = 0;
	for(; s[i]; ++i);
	return i;
}
void strcpy(char * d,const char * s)
{
	int i = 0;
	for( i = 0; s[i]; ++i)
		d[i] = s[i];
	d[i] = 0;
		
}
int strcmp(const char * s1,const char * s2)
{
	for(int i = 0; s1[i] && s2[i] ; ++i) {
		if( s1[i] < s2[i] )
			return -1;
		else if( s1[i] > s2[i])
			return 1;
	}
	return 0;
}
void strcat(char * d,const char * s)
{
	int len = strlen(d);
	strcpy(d+len,s);
}
class MyString
{//补充你的代码

};


int CompareString( const void * e1, const void * e2)
{
	MyString * s1 = (MyString * ) e1;
	MyString * s2 = (MyString * ) e2;
	if( * s1 < *s2 )
	return -1;
	else if( *s1 == *s2)
	return 0;
	else if( *s1 > *s2 )
	return 1;
}
int main()
{
	MyString s1("abcd-"),s2,s3("efgh-"),s4(s1);
	MyString SArray[4] = {"big","me","about","take"};
	cout << "1. " << s1 << s2 << s3<< s4<< endl;
	s4 = s3;
	s3 = s1 + s3;
	cout << "2. " << s1 << endl;
	cout << "3. " << s2 << endl;
	cout << "4. " << s3 << endl;
	cout << "5. " << s4 << endl;
	cout << "6. " << s1[2] << endl;
	s2 = s1;
	s1 = "ijkl-";
	s1[2] = 'A' ;
	cout << "7. " << s2 << endl;
	cout << "8. " << s1 << endl;
	s1 += "mnop";
	cout << "9. " << s1 << endl;
	s4 = "qrst-" + s2;
	cout << "10. " << s4 << endl;
	s1 = s2 + s4 + " uvw " + "xyz";
	cout << "11. " << s1 << endl;
	qsort(SArray,4,sizeof(MyString),CompareString);
	for( int i = 0;i < 4;i ++ )
	cout << SArray[i] << endl;
	//s1的从下标0开始长度为4的子串
	cout << s1(0,4) << endl;
	//s1的从下标5开始长度为10的子串
	cout << s1(5,10) << endl;
	return 0;
}

输入

无

输出

1. abcd-efgh-abcd-
2. abcd-
3.
4. abcd-efgh-
5. efgh-
6. c
7. abcd-
8. ijAl-
9. ijAl-mnop
10. qrst-abcd-
11. abcd-qrst-abcd- uvw xyz
about
big
me
take
abcd
qrst-abcd-

样例输入

无

样例输出

1. abcd-efgh-abcd-
2. abcd-
3. 
4. abcd-efgh-
5. efgh-
6. c
7. abcd-
8. ijAl-
9. ijAl-mnop
10. qrst-abcd-
11. abcd-qrst-abcd- uvw xyz
about
big
me
take
abcd
qrst-abcd-

来源

Guo Wei

#include <cstdlib>
#include <iostream>
using namespace std;
int strlen(const char* s)
{
	int i = 0;
	for (; s[i]; ++i);
	return i;
}
void strcpy(char* d, const char* s)
{
	int i = 0;
	for (i = 0; s[i]; ++i)
		d[i] = s[i];
	d[i] = 0;

}
int strcmp(const char* s1, const char* s2)
{
	for (int i = 0; s1[i] && s2[i]; ++i) {
		if (s1[i] < s2[i])
			return -1;
		else if (s1[i] > s2[i])
			return 1;
	}
	return 0;
}
void strcat(char* d, const char* s)
{
	int len = strlen(d);
	strcpy(d + len, s);
}
class MyString
{
	char* p;
    public:
    	MyString() {
		   p=new char[1];
		   p[0]='\0'; 
		}
		MyString(const char* ch) {
			if (ch) {
				p = new char[strlen(ch) + 1];
				strcpy(p, ch);
			}
			else p = NULL;
		}
		MyString(const MyString & str) {
				if (str.p) {
					p = new char[strlen(str.p) + 1];
					strcpy(p, str.p);
				}
				else p = NULL;
			}
		~MyString() {
				if (p)
					delete[]p;
			}
		friend ostream& operator<<(ostream & os, const MyString & str) {
				os << str.p;
				return os;
			}
		MyString & operator=(const MyString & str) {
			    if(p) delete [] p;
				p = new char[strlen(str.p) + 1];
				strcpy(p, str.p);
				p[strlen(str.p)] = '\0';
				return *this;
			}
		MyString & operator=(const char* ch) {
				delete[]p;
				p = new char[strlen(ch) + 1];
				strcpy(p, ch);
				return *this;
			}
		MyString operator+(const char* ch) {
				char* temp = new char[strlen(p) + strlen(ch)+1];
				strcpy(temp, p);
				strcat(temp, ch);
				MyString str(temp);
				return str;
			}
		MyString operator+(MyString & str) {
				char* temp = new char[strlen(p) + strlen(str.p)+1];
				strcpy(temp, p);
				strcat(temp, str.p);
			    MyString str1(temp);
				return str1;
			}
		friend MyString operator+(const char* p, MyString & str) {
				char* temp = new char[strlen(p) + strlen(str.p) + 1];
				strcpy(temp, p);
				strcat(temp, str.p);
				MyString str1(temp);
				return str1;
			}
		char& operator[] (int i) {
			return p[i];
		}
		MyString& operator+=(const char* ch) {
				char* temp = new char[strlen(p) + 1];
				strcpy(temp, p);
				delete[]p;
				p = new char[strlen(temp) + strlen(ch) + 1];
				strcpy(p, temp);
				strcat(p, ch);
				return *this;
			}
		char* operator()(int fst, int lst) {
				char* temp = new char[lst - fst + 2];
				int j = fst - 1;
				for (;j <= lst - 1;j++) {
					temp[j - fst + 1] = p[j];
				}
				temp[lst - fst + 2] = '\0';
				return temp;
			}
		bool operator<(MyString & str) {
			int i = 0;
			for (;p[i] && str.p[i];i++) {
					if (p[i] < str.p[i]) return true;
					else if (p[i] > str.p[i]) return false;
				}
				if (p[i] < str.p[i]) return true;
				else return false;
			}
		bool operator>(MyString & str) {
			int i = 0;
				for (;p[i] && str.p[i];i++) {
					if (p[i] > str.p[i]) return true;
					else if (p[i] < str.p[i]) return false;
				}
				if (p[i] > str.p[i]) return true;
				else return false;
			}
		bool operator==(MyString & str) {
			int i = 0;
				for (;p[i] && str.p[i];i++){
					if (p[i] != str.p[i]) return false;
			}
			if (p[i] == str.p[i])return true;
		}
		};
int CompareString(const void* e1, const void* e2)
{
	MyString* s1 = (MyString*)e1;
	MyString* s2 = (MyString*)e2;
	if (*s1 < *s2)
		return -1;
	else if (*s1 == *s2)
		return 0;
	else if (*s1 > *s2)
		return 1;
}
int main()
{
	MyString s1("abcd-"), s2, s3("efgh-"), s4(s1);//有两类构造函数，一类的参数是字符串，一类的参数是字符串
	MyString SArray[4] = { "big","me","about","take" };
	cout << "1. " << s1 << s2 << s3 << s4 << endl;//重载了<<运算符
	s4 = s3;//重载了等号运算符
	s3 = s1 + s3;//重载了加号运算符
	cout << "2. " << s1 << endl;
	cout << "3. " << s2 << endl;
	cout << "4. " << s3 << endl;
	cout << "5. " << s4 << endl;
	cout << "6. " << s1[2] << endl;//重载[]运算符
	s2 = s1;
	s1 = "ijkl-";
	s1[2] = 'A';
	cout << "7. " << s2 << endl;
	cout << "8. " << s1 << endl;
	s1 += "mnop"; //重载+=运算符
	cout << "9. " << s1 << endl;
	s4 = "qrst-" + s2;
	cout << "10. " << s4 << endl;
	s1 = s2 + s4 + " uvw " + "xyz";
	cout << "11. " << s1 << endl;
	qsort(SArray, 4, sizeof(MyString), CompareString);
	for (int i = 0;i < 4;i++)
		cout << SArray[i] << endl;
	//s1的从下标0开始长度为4的子串
	cout << s1(0, 4) << endl;
	//s1的从下标5开始长度为10的子串
	cout << s1(5, 10) << endl;
	return 0;
}