1 条题解

  • 0
    @ 2024-12-24 9:59:18

    C :

    #include<stdio.h>
    #include<string.h>
    int main(){
    	char in[51];
    	int out[51];
    	int k;
    	int len;
    	int i;
    	int m;
    	scanf("%d",&m);
    	getchar();
    	while(m--){
    		gets(in);
    		len = strlen(in);
    		k = 0;
    		for(i=0;i<len;i++){
    			if(in[i]>='0'&&in[i]<='9'){
    				out[k++] = i + 1;
    			}
    		}
    		for(i=0;i<k;i++){
    			if(i==k-1){
    				printf("%d\n",out[i]);
    			}
    			else
    			{
    				printf("%d ",out[i]);
    			}
    		}
    
    	}
    	return 0;
    }
    

    C++ :

    #include <cstdio>
    #include <cstring>
    #include <cctype>
    
    int main() {
        //freopen("test.in", "r", stdin);
        //freopen("test.out", "w", stdout);
        int t;
        char s[100];
        scanf("%d", &t);
        while (t--) {
            scanf("%s", s);
            int n = strlen(s);
            bool first = true;
            for (int i = 0; i < n; ++i)
                if (isdigit(s[i])) {
                    if (first) first = false;
                    else putchar(' ');
                    printf("%d", i + 1);
                }
            puts("");
        }
        return 0;
    }
    
    

    Java :

    
    
    import java.util.Scanner;
    
    public class Main {
       private static Scanner s = new Scanner(System.in) ;
       
       public static void main(String[] args) {
    	  int m = s.nextInt() ;
    	  
    	  for (int i = 0; i < m; i++) {
    		  String str = s.next() ;
    		  
    		  char c[] = str.toCharArray() ;
    		  int sum = 0 ;
    		  for (int j = 0; j < c.length; j++) {
    			 if(c[j]>='0'&&c[j]<='9'){
    				sum++ ;
    			 }
    		  }
    		  int a[] = new int[sum] ;
    		  int k = 0 ;
    		  for (int j = 0; j < c.length; j++) {
    				 if(c[j]>='0'&&c[j]<='9'){
    					a[k] = j ;
    					k++ ;
    				 }
    			  }
    		  for (int j = 0; j < a.length-1; j++) {
    			System.out.print(a[j]+1+" ") ;
    		  }
    		  System.out.println(a[a.length-1]+1);
    	  }
       }
    }
    
    
    • 1

    信息

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