串简易操作---下标0开始存‘\0‘

#include<iostream>
using namespace std;
#define MaxLength 255
//typedef struct
//{
//	char ch[MaxLength];
//	int length;
//}SString;
typedef struct
{
	char* ch;
	int len;
}HStr;
class Stu {
public:
	Stu();
	~Stu();
	bool StrAssign(HStr &T, char* chars);
	int StrCompare(HStr S, HStr T) const;
	int StrLength(HStr S) const;
	bool Concat(HStr& T, HStr S1, HStr S2);
	bool SubString(HStr& Sub, HStr S, int pos, int len);
public:
	bool StrCopy(HStr& T, HStr S);
	bool strEmpty(HStr S) const;
	int Index(HStr S, HStr T);
public:
	bool ClearString(HStr& S);
	bool DestroyString(HStr& S);
};
Stu::Stu(){}
Stu::~Stu() {}
bool Stu::StrAssign(HStr& T, char* chars) {
	if (T.ch!=NULL) 
		delete T.ch;//T若有数据清楚
	int len=0;
	char* ch = chars;
	while (*ch)
	{
		len++;
		ch++;
	}
	if (len == NULL)
	{
		T.ch = NULL;
		T.len = 0;
		return true;
	}
	else
	{
		T.ch = new char[len+1];//+1存储'0'否则delete 报错访问越界
		if (NULL == T.ch) return false;
		for(int i=0;i<=len;i++)
		{
			T.ch[i] = chars[i];
		}
		T.len = len;
		return true;
	}
}
int Stu::StrCompare(HStr S, HStr T) const
{
	for (int i=0;i<S.len&&i<T.len;i++)
	{
		if (S.ch[i] != T.ch[i])
			return S.ch[i] - T.ch[i];
	}
	return S.len - T.len;
}
int Stu::StrLength(HStr S) const
{
	return S.len;
}
bool Stu::Concat(HStr& T, HStr S1, HStr S2)
{
	if (T.ch != NULL) 
		delete T.ch;
	T.ch= new char[S1.len + S2.len + 1];
	if (NULL == T.ch) return false;
	int i = 0;
	for (; i < S1.len; i++)
	{
		T.ch[i] = S1.ch[i];
	}
	for (int j=0; j <=S2.len; j++)
	{
		T.ch[i++] = S2.ch[j];
	}
	T.len = S1.len + S2.len;
	return true;
}
bool Stu::SubString(HStr& Sub, HStr S, int pos, int len)
{
	if (Sub.ch != NULL) 
		delete Sub.ch;
	if (pos + len > S.len) return false;
	if (strEmpty(S)) return false;
	Sub.ch = new char[len + 1];
	for (int i = 0; i <len  ; i++)
	{
		Sub.ch[i] = S.ch[pos++];
	}
	Sub.ch[len] = '\0';
	Sub.len = len;
	return true;
}
bool Stu::strEmpty(HStr S) const
{
	return S.len == 0;
}
bool Stu::ClearString(HStr& S)
{
	delete S.ch;
	S.len = 0;
	return true;
}
bool Stu::DestroyString(HStr& S)
{
	delete S.ch;
	S.ch = NULL;
	S.len = 0;
	return true;
}
bool Stu::StrCopy(HStr& T, HStr S)
{
	ClearString(T);
	T.ch = new char[S.len + 1];
	for (int i = 0; i <= S.len; i++)
	{
		T.ch[i] = S.ch[i];
	}
	T.len = S.len;
	return true;
}
int Stu::Index(HStr S, HStr T) 
{
	for (int i = 0; i <S.len-T.len+1; i++)
	{
		HStr sub;
		sub.ch = NULL;
		SubString(sub, S, i, T.len);
		if (StrCompare(sub, T) == 0) return i+1;
	}
	return 0;
}
int main()
{
	Stu S;
	HStr T;
	HStr S1, S2;
	T.ch = NULL;
	S1.ch = NULL;
	S2.ch = NULL;
	char chars1[11] = "helloworld";
	S.StrAssign(T, chars1);
	char chars2[11] = "qwertyuiop";
	//char chars2[11] = "asdfghjkl";
	S.StrAssign(S1, chars2);
	char chars3[11] = "asdfghjklz";
	S.StrAssign(S2, chars3);
	cout << T.ch << endl;
	cout << S1.ch << endl;
	cout << S2.ch << endl;
	HStr H;
	H.ch = NULL;
	cout << S.StrLength(T) << endl;
	int ret = S.StrCompare(S1, S2);
	if (ret > 0)
		cout << "S1 > S2" << endl;
	if (ret == 0)
		cout << "S1 = S2" << endl;
	if (ret < 0)
		cout << "S1 < S2" << endl;
	if (S.Concat(H, S1, S2))
		cout << H.ch << endl;
	if (S.Concat(H, S1, S2))
		cout << "H:" << endl;
	cout << H.ch << endl;
	cout << S.StrLength(T) << endl;
	cout << S.StrLength(S1) << endl;
	cout << S.StrLength(S2) << endl;
	cout << S.StrLength(H) << endl;
	cout << "-----------" << endl;
	S.StrCopy(S1, S2);
	cout << S2.ch << endl;
	cout << S1.ch << endl;
	if (S.SubString(H, S1, 3, 4))
		cout << H.ch << endl;
	cout << S.Index(S2, H) << endl;
	S.DestroyString(H);
	S.DestroyString(S1);
	S.DestroyString(S2);
	return 0;
}