C 解法, 执行用时: 1ms, 内存消耗: 328KB, 提交时间: 2021-07-26

#include<stdio.h>
#include<string.h>

int main(void)
{
    int count, i, len, flg;
    char cmdin[1000];
    while(gets(cmdin))
    {
        len = strlen(cmdin);
        flg = 0;
        count = 1;
        //参数个数
        for (i=0; i<len; i++)
        {
            if((flg==0) && (cmdin[i] == '"'))
            {
                flg = 1;
            }
            else if((flg==1) && (cmdin[i] == '"'))
            {
                flg = 0;
            }
            else if((flg==0) && (cmdin[i] == ' '))
                count++;
        }
        
        printf("%d\n", count);
        for (i=0; i<len; i++)
        {
            if((flg==0) && (cmdin[i] == '"'))
            {
                flg = 1;
            }
            else if((flg==1) && (cmdin[i] == '"'))
            {
                flg = 0;
            }
            else if((flg==0) && (cmdin[i] != ' '))
                printf("%c", cmdin[i]);
            else if((flg==0) && (cmdin[i] == ' '))
                printf("\n");
            else if(flg==1)
                printf("%c", cmdin[i]);
        }
        printf("\n");
    }
    
    return 0;
}

C 解法, 执行用时: 1ms, 内存消耗: 340KB, 提交时间: 2020-12-20

#include <stdio.h>
#include <string.h>
int main(void)
{
	int i, j, len, idx, arr[88];
	char s[100], ch;
	while(gets(s)){
		len = strlen(s);
		idx = 0;
		for(i=j=0; i<len; ){
			if(s[i]=='"'){
				j = ++i;
				for( ; s[i]!='"'; i++) ;
				s[i] = '\0';
				arr[idx++] = j;
					
				if(i+1<len && s[i+1]==' ') { j = i += 2; continue; }
				j = ++i;
			}
			else{
				for( ; i<len; i++)
					if(s[i]==' ') break;
				if(i<len){
					s[i] = '\0';
					arr[idx++] = j;
					
					j = ++i;
				}
			}
		}
		
		if(j<len){
			printf("%d\n", idx+1);
			for(i=0; i<idx; i++)
				printf("%s\n", s+arr[i]);
			printf("%s\n", s+j);
			continue;
		}
		
		printf("%d\n", idx);
		for(i=0; i<idx; i++)
			printf("%s\n", s+arr[i]);
	}
	return 0;
}