C/C++数据结构:串的五个常用操作

/**
*
* Althor: Hacker Hao
* Create: 2023.10.14
*
*/
#include <bits/stdc++.h>
using namespace std;
#define MAXSIZE 200
#define ERROR -1
#define OK 1
typedef struct
{
	char data[MAXSIZE];
	int length;
}SqString;
//实现串赋值、串比较、求串长、串联接以及求子串这5种基本操作。

void Assign(SqString &s, char str[])
{
	int i = 0;
	for (i = 0; str[i] != '\0'; i++)
		s.data[i] = str[i];
	s.length = i;
}

void Compare(SqString *s1, SqString *s2)
{
	int i = 0;
	for (i = 0; s1->data[i] != '\0' && s2->data[i] != '\0'; i++)
	{
		if (s1->data[i] > s2->data[i])
		{
			cout << "前者大" << endl;
			return;
		}

		if (s1->data[i] < s2->data[i])
		{
			cout << "后者大" << endl;
			return;
		}
	}
	cout << "一样大" << endl;
	return;
}

int Length(SqString* s)
{
	return s->length;
}

void Concat(SqString* s1, SqString* s2, SqString* s)
{
	int t = 0;
	if (s1->length + s2->length <= MAXSIZE)
	{
		for (int i = 0; i < s1->length; i++)
		{
			s->data[i] = s1->data[i];
		}
		for (int i = 0, j = s1->length; j < s1->length + s2->length; i++, j++)
		{
			s->data[j] = s2->data[i];
		}
		s->length = s1->length + s2->length;
		t = s->length;
	}
	else
	{
		for (int i = 0; i < s1->length; i++)
		{
			s->data[i] = s1->data[i];
		}
		for (int i = 0, j = s1->length; i< MAXSIZE - s1->length; i++, j++)
		{
			s->data[j] = s2->data[i];
		}
		t = MAXSIZE;
	}
	cout << "新的链接好的串为:" << endl;
	for (int i = 0; i < t; i++)
	{
		cout << s->data[i];
	}
	cout << endl;
}
int SubString(SqString &Sub, SqString s, int pos, int len)
{
	if (pos < 1 || pos > s.length || len < 0 || len > s.length - pos + 1)
		return ERROR;
	for (int i = 0; i < len; i++,pos++)
	{
		Sub.data[i] = s.data[pos];
	}
	Sub.length = len;

	for (int i = 0; i < len; i++)
	{
		cout << Sub.data[i];
	}
	cout << endl;

	return OK;
}

int main()
{
	cin.tie(0), cout.tie(0);
	SqString s1, s2, s3, Sub;

	char str1[200] = "hello";
	char str2[200] = "nihao";
	Assign(s1, str1);
	Assign(s2, str2);

	Compare(&s1, &s2);

	cout << "s1的长度为:" << Length(&s1) << endl;
	cout << "s2的长度为:" << Length(&s2) << endl;

	Concat(&s1, &s2, &s3);

	cout << "输出的字串为:" << endl;
	SubString(Sub,s3, 3, 4);
	return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值