zoukankan      html  css  js  c++  java
  • google在线测试练习2

    Problem

    Given a list of space separated words, reverse the order of the words. Each line of text contains L letters and W words. A line will only consist of letters and space characters. There will be exactly one space character between each pair of consecutive words.

    Input

    The first line of input gives the number of cases, N.
    N test cases follow. For each test case there will a line of letters and space characters indicating a list of space separated words. Spaces will not appear at the start or end of a line.

    Output

    For each test case, output one line containing "Case #x: " followed by the list of words in reverse order.

    Limits

    Small dataset

    N = 5
    1 ≤ L ≤ 25

    Large dataset

    N = 100
    1 ≤ L ≤ 1000

    思路:先一个一个单词反转,再将整个字符串反转。

    #include<iostream>
    #include<fstream>
    #include<string>
    using namespace std;
    int main()
    {
    	int n_case;
    	ifstream ifile("B-large-practice.in");
    	ofstream ofile("resultb2.txt");
    	ifile >> n_case;
    	for(int i = 0; i <= n_case; i++)
    	{
    		char line[1002];
    		ifile.getline(line, 1002);
    		string words(line);
    		int begin = 0;
    		int end = 0;
    		if(i == 0)
    			continue;
    		for(int i = 1; i < words.length(); i++)
    		{
    			if(words[i] ==  ' ')
    			{
    				int sum = begin + i - 1;
    				for(int j = begin; j <= sum / 2; j++)
    				{
    					char tmp = words[j];
    					words[j] = words[sum - j];
    					words[sum - j] = tmp;
    				}
    				begin = i + 1;
    			}
    		}
    		int sum = begin + words.length() - 1;
    		for(int j = begin; j <= sum / 2; j++)
    		{
    			char tmp = words[j];
    			words[j] = words[sum - j];
    			words[sum - j] = tmp;
    		}
    		sum = words.length() - 1;
    		for(int j = 0; j <= sum / 2; j++)
    		{
    			char tmp = words[j];
    			words[j] = words[sum - j];
    			words[sum - j] = tmp;
    		}
    		ofile << "Case #" << i << ": " << words << endl;
    	}
    	return 0;
    }
    


    版权声明:本文博主原创文章,博客,未经同意不得转载。

  • 相关阅读:
    filter()函数
    递归算法
    日志模块nb_log
    sys.argv[]简单阐述
    DB2中字符、数字和日期类型之间的转换
    Java 连接 Hive的样例程序及解析
    对hadoop namenode -format执行过程的探究
    想要成为牛人、大佬,那请至少拥有这12项技能!
    形象决定你的收入,别问为什么!
    年轻人,能用钱解决的,绝不要花时间(转)
  • 原文地址:https://www.cnblogs.com/lcchuguo/p/4887991.html
Copyright © 2011-2022 走看看