1 条题解

  • 0
    @ 2025-4-7 21:29:25

    C :

    #include<stdio.h>
    #include<string.h>
    int main()
    {
    	char str[10000];
    	int b,i,z,s,k,q;
    	z=s=k=q=0;
    	gets(str);
    	b=strlen(str);
    	for(i=0;i<b;i++)
    	{
    		if(str[i]>=65&&str[i]<=90||str[i]>=97&&str[i]<=122)z++;
    		else
    			if(str[i]>=48&&str[i]<=57)s++;
    		else
    			if(str[i]==32)k++;
    		else
    			q++;
    	}
    	printf("%d %d %d %d",z,s,k,q);
    	return 0;
    }
    

    C++ :

    #include "stdio.h"
    #include "string.h"
    int num(char str[])
    {
      int i,sum=0;
      for(i=0;str[i]!='\0';i++)
        if(str[i]>='0'&&str[i]<='9')
    		sum++;
    	return sum;
    }
    int chart(char str[])
    {
     int i,sum=0;
      for(i=0;str[i]!='\0';i++)
        if(str[i]>='A'&&str[i]<='Z'||(str[i]>='a'&&str[i]<='z'))
    		sum++;
    	return sum;
    }
    int kongge(char str[])
    {
     int i,sum=0;
      for(i=0;str[i]!='\0';i++)
        if(str[i]==' ')
    		sum++;
    	return sum;
    }
    int qita(char str[])
    {
    	int len;
     len=strlen(str);
    return len-kongge(str)-chart(str)-num(str);
    }
    int main(int argc, char* argv[])
    {
    	char str[100];
    	while(gets(str))
    	{
    	 printf("%d %d %d %d \n",chart(str),num(str),kongge(str),qita(str));
    	}
    	return 0;
    }
    
    

    Java :

    import java.util.Scanner;
     
    public class  Main {
        public static void main(String[] args) {
            Scanner cin= new Scanner(System.in);
            while (cin.hasNext()) {
                String  a = cin.nextLine();
                int letterCounter = 0;
                int digitCounter = 0;
                int spaceCounter = 0;
                int otherCounter = 0;
                char[] charArray = a.toCharArray();
                for (int i = 0; i < charArray.length; i++) {
                    if (Character.isLetter(charArray[i])) {
                        letterCounter++;
                    } else if (Character.isDigit(charArray[i])) {
                        digitCounter++;
                    } else if (Character.isSpaceChar(charArray[i])) {
                        spaceCounter++;
                    } else {
                        otherCounter++;
                    }
                }
                System.out.println(letterCounter + " " + digitCounter + " " + spaceCounter + " " + otherCounter);
            }
        }
    }
    
    • 1

    信息

    ID
    1440
    时间
    1000ms
    内存
    128MiB
    难度
    (无)
    标签
    (无)
    递交数
    0
    已通过
    0
    上传者