郑轻OJ - 1155: 字符串比较多实例

最新推荐文章于 2022-03-26 22:29:15 发布

bl2002.

最新推荐文章于 2022-03-26 22:29:15 发布

阅读量647

点赞数 1

文章标签：蓝桥杯 c++ c语言

本文链接：https://blog.csdn.net/god_libl/article/details/122630456

版权

#include <iostream>
#include <cstring>
#include <cctype>
using namespace std;

char a[10010];
char b[10010];
int mycmp(char* s1, char* s2)
{
	int re = 0;
	int L1 = strlen(s1);
	int L2 = strlen(s2);
	int L = min(L1, L2);
	for (int i = 0; i < L; i++)
	{
		if (tolower(s1[i]) == tolower(s2[i]))
		{
			if (s1[i] > s2[i])
			{
				re = 1;
				break;
			}
			else if (s1[i] < s2[i])
			{
				re = -1;
				break;
			}
			else
				continue;
		}
		else 
		{
			if (tolower(s1[i]) > tolower(s2[i]))
			{
				re = 1;
				break;
			}
			else
			{
				re = -1;
				break;
			}
		}
	}
	if (re == 0)
	{
		if (L1 == L2) re = 0;
		else if (L1 < L2) re = -1;
		else re = 1;
	}
	return re;
}
int main()
{
	while (cin >> a >> b)
	{
		if (mycmp(a, b) == -1)
			cout << "YES" << endl;
		else
			cout << "NO" << endl;
	}
	return 0;
}