The mixed letters

The mixed letters

时间: 1ms        内存:128M

描述:

Mike is very upset that many people on the Internet usually mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' case in every word so that it either only consisted of lowercase letters or only consisted of uppercase ones. And he wants to change as few letters as possible in the word.
For example, the word "HoUse" must be changed to "house", and the word "ViP", to "VIP".
If a word contains an equal number of uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, "maTRIx" should be changed to "matrix".
You task is to use the given method to change the given word.

输入:

The first line contains a single integer n (n<=30), indicating the number of test cases.
Then following n lines, each line contains a word s, it consists of uppercase and lowercase
Latin letters and its length is between 1 and 100, inclusive.

输出:

Print the word s after change. If the given word s has strictly more uppercase letters, make the word written in the uppercase register, otherwise, in the lowercase one.

示例输入:

3
HoUse
ViP
maTRIx

示例输出:

house
VIP
matrix

提示:

参考答案(内存最优[752]):

#include <stdio.h>
#include <stdlib.h>

int main()
{
    char a[110];
    int n,i,b,c;
    scanf("%d",&n);
    while(n--)
    {
        b=0;
        c=0;
        scanf("%s",a);
        for(i=0; i<strlen(a); i++)
        {
            if(a[i]>='a'&&a[i]<='z')
                b++;
            if(a[i]>='A'&&a[i]<='Z')
                c++;
        }
        if(c>b)
        {
            for(i=0; i<strlen(a); i++)
                if(a[i]>='a'&&a[i]<='z')
                    a[i]-=32;
        }
        else
        {
            for(i=0; i<strlen(a); i++)
            if(a[i]>='A'&&a[i]<='Z')
                a[i]+=32;
        }
        printf("%s\n",a);
    }
    return 0;
}

参考答案(时间最优[0]):

#include <iostream>

using namespace std;

int main()
{
    short int n,i,j,k;
    short int lowernum,uppernum;
    char s[201];
    cin>>n;
    cin.get();
    for(i=0;i<n;i++)
    {

        cin.getline(s,201);
        j=0;
        lowernum=uppernum=0;
        while(s[j]!='\0'){
            if(s[j]&32)
                lowernum++;
            else
                uppernum++;
            j++;

        }
        if(uppernum>lowernum){
            for(k=0;k<j;k++)
            {
                if(s[k]&32)
                    s[k]=s[k]&223;
            }
        }
        else{
            for(k=0;k<j;k++)
                if((s[k]&32)==0)
                    s[k]=s[k]|32;
        }
        cout<<s<<endl;
    }
    return 0;
}

题目和答案均来自于互联网,仅供参考,如有问题请联系管理员修改或删除。

点赞

发表评论

电子邮件地址不会被公开。必填项已用 * 标注