CF112A Petya and Strings（转发大小字符）

题目描述

Little Petya loves presents. His mum bought him two strings of the same size for his birthday. The strings consist of uppercase and lowercase Latin letters. Now Petya wants to compare those two strings lexicographically. The letters' case does not matter, that is an uppercase letter is considered equivalent to the corresponding lowercase letter. Help Petya perform the comparison.

输入格式

Each of the first two lines contains a bought string. The strings' lengths range from 11 to 100100 inclusive. It is guaranteed that the strings are of the same length and also consist of uppercase and lowercase Latin letters.

输出格式

If the first string is less than the second one, print "-1". If the second string is less than the first one, print "1". If the strings are equal, print "0". Note that the letters' case is not taken into consideration when the strings are compared.

题意翻译

输入两个字符串，大小写无关紧要，比较它们的大小。

输入格式

两个字符串（保证长度相等）

输出格式

如果第一个字符串小于第二个字符串，则输出“-1”。如果第二个字符串小于第一个字符串，则输出“1”。如果字符串相同，则打印“0”。请注意，比较字符串时不考虑字母的大小写。

输入输出样例

输入

aaaa

aaaA

输出  

0

输入  

abs

Abz

输出

-1

输入  

abcdefg

AbCdEfF

输出

1

题意分析，我们可以用string来做，也可以用char+strcmp函数来做；

我们首先要转换为同一种类型的函数，例如towlower就是转换函数

具体看代码；

char做法

#include<bits/stdc++.h>
using namespace std;
char s1[105],s2[105];
int main()
{
  cin >> s1 >> s2;
  int l1 = strlen(s1), l2 = strlen(s2);
  for (int i = 0; i < l1; i++) s1[i] = towlower(s1[i]);
  for (int i = 0; i < l2; i++) s2[i] = towlower(s2[i]);
  int ans = strcmp(s1, s2);
  printf("%d", ans==0?0:(ans>0?1:-1));
}

string做法

#include<bits/stdc++.h>
using namespace std;
int main()
{
  string s1 ,s2 ;int ans;
  cin>>s1>>s2;
  int l1= s1.size(),l2=s2.size();
  for(int i=0;i<s1.size();i++) s1[i]=towlower(s1[i]);
  for(int i=0;i<s2.size();i++) s2[i]=towlower(s2[i]);
if(s1<s2)
    cout<<-1;
  else
    if(s1==s2)
      cout<<0;
    if(s1>s2)
      cout<<1;
}