4 solutions

  • 1
    @ 2025-1-21 10:11:23
    #include<bits/stdc++.h> 
    using namespace std;
    const int N=210;
    char s1[N],s2[N]; 
    int main() 
    { 
    	cin.getline(s1,N);
    	int n=strlen(s1);
    	int cnt=0;
    	for(int i=0;i<n;i++)
    	{
    		if(s1[i]!=' ')
    		{
    			s2[cnt++]=s1[i];
    			continue;
    		}
    		else
    		{
    			int j=i;
    			s2[cnt++]=s1[i];
    			while(j<n&&s1[j]==' ') j++;
    			j--;
    			i=j;
    		}
    	}
    	cout<<s2;
    	return 0; 
    }
    
    • 1
      @ 2024-11-10 14:15:52
      #include<bits/stdc++.h> 
      using namespace std;
      const int N=210;
      char s1[N],s2[N]; 
      int main() 
      { 
      	cin.getline(s1,N);
      	int n=strlen(s1);
      	int cnt=0;
      	for(int i=0;i<n;i++)
      	{
      		if(s1[i]!=' ')
      		{
      			s2[cnt++]=s1[i];
      			continue;
      		}
      		else
      		{
      			int j=i;
      			s2[cnt++]=s1[i];
      			while(j<n&&s1[j]==' ') j++;
      			j--;
      			i=j;
      		}
      	}
      	cout<<s2;
      	return 0; 
      }
      • 0
        @ 2025-10-7 14:16:52
        #include<bits/stdc++.h>
        using namespace std;
        const int N=210;
        char s1[N],s2[N];
        int main()
        {
        	cin.getline(s1,N);
        	int n=strlen(s1);
        	int idx=0;
        	for(int i=0;i<n;i++)
        	{
        		if(s1[i]!=' ')
        		{
        			s2[idx]=s1[i];
        			idx++;
        		}
        		else
        		{
        			s2[idx]=s1[i];
        			idx++;
        			//跳到最后一个空格的位置
        			int j=i; 
        			while(j<n&&s1[j]==' ') j++;
        			j--;
        			i=j;
        		}
        	}
        	cout<<s2;
        	return 0;
        }
        
        • 0
          @ 2024-11-2 15:42:14
          #include<bits/stdc++.h>
          using namespace std;
          const int N=210;
          char s1[N],s2[N];
          int main()
          {
              cin.getline(s1,N);
              int n=strlen(s1);
              int cnt=0;
              for(int i=0;i<n;i++)
              {
                  if(s1[i]!=' ')
                  {
                      s2[cnt++]=s1[i];
                      continue;
                  }
                  else
                  {
                      int j=i;
                      s2[cnt++]=s1[i];
                      while(j<n&&s1[j]==' ')j++;
                      j--;
                      i=j;
                  }
              }
              cout<<s2;
              return 0;
          }
          
          • 1

          Information

          ID
          85
          Time
          1000ms
          Memory
          256MiB
          Difficulty
          3
          Tags
          # Submissions
          106
          Accepted
          39
          Uploaded By