zoukankan      html  css  js  c++  java
  • A. 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 stringslexicographically. The letters' case does not matter, that is an uppercase letter is considered equivalent to the corresponding lowercase letter. Help Petya perform the comparison.

    Input

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

    Output

    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.

    Examples
    input
    aaaa
    aaaA
    output
    0
    input
    abs
    Abz
    output
    -1
    input
    abcdefg
    AbCdEfF
    output
    1
    Note

    If you want more formal information about the lexicographical order (also known as the "dictionary order" or "alphabetical order"), you can visit the following site:

    • http://en.wikipedia.org/wiki/Lexicographical_order
     1 #include <iostream>
     2 #include <stdio.h>
     3 using namespace std;
     4 char a[110],b[110];
     5 int main(){
     6     int i;
     7     scanf("%s",a);
     8     scanf("%s",b);
     9     for(i=0;a[i]!='';i++){
    10         if(a[i]>='A'&&a[i]<='Z' )
    11             a[i]+=32;
    12         if(b[i]>='A'&&b[i]<='Z' )
    13             b[i]+=32;
    14             if(a[i]>b[i]) {
    15                 printf("1
    ");
    16                 break;
    17             }
    18             else if(a[i]<b[i]){
    19                 printf("-1
    ");
    20                 break;
    21             }
    22             else continue;
    23     }
    24     if(a[i]=='')  printf("0
    ");
    25     return 0;
    26 }
  • 相关阅读:
    基于python实现自动化办公学习笔记一
    [django]上下文管理器
    [django]中间件
    分布式锁实现
    为什么Redis可以方便地实现分布式锁
    索引字段说明
    COUNT 和 IFNULL函数
    占用空间区别
    java排序算法(七):折半插入排序
    java排序算法(六):直接插入排序
  • 原文地址:https://www.cnblogs.com/z-712/p/7307477.html
Copyright © 2011-2022 走看看