zoukankan      html  css  js  c++  java
  • UVA

    Andy, 8, has a dream - he wants to produce his very own dictionary. This is not an easy task for him, as the number of words that he knows is, well, not quite enough. Instead of thinking up all the words himself, he has a briliant idea. From his bookshelf he would pick one of his favourite story books, from which he would copy out all the distinct words. By arranging the words in alphabetical order, he is done! Of course, it is a really time-consuming job, and this is where a computer program is helpful. You are asked to write a program that lists all the different words in the input text. In this problem, a word is defined as a consecutive sequence of alphabets, in upper and/or lower case. Words with only one letter are also to be considered. Furthermore, your program must be CaSe InSeNsItIvE. For example, words like “Apple”, “apple” or “APPLE” must be considered the same.
    Input
    The input file is a text with no more than 5000 lines. An input line has at most 200 characters. Input is terminated by EOF.
    Output
    Your output should give a list of different words that appears in the input text, one in a line. The words should all be in lower case, sorted in alphabetical order. You can be sure that he number of distinct words in the text does not exceed 5000.
    Sample Input
    Adventures in Disneyland
    Two blondes were going to Disneyland when they came to a fork in the road. The sign read: "Disneyland Left."
    So they went home.
    Sample Output
    a

    adventures

    blondes

    came

    disneyland

    fork

    going

    home

    in

    left

    read

    road

    sign

    so

    the

    they

    to

    two

    went

    were

    when


    题意:将文章中所有单词转换成小写,并按字典序排序

    解法:可使用STL的vector容器,储存每个单词,然后使用sort函数,将vector中的每个单词按照字典序排,最后输出

    #include<stdio.h>  
    #include<iostream>  
    #include<algorithm>  
    #include<ctype.h> 
    #include<vector>  
    using namespace std;  
    char c,s[10010];  
    vector<string> vec;  
    int main()  
    { int i,m=0;  
      while(~(c=getchar()))  
      { if(isupper(c)||islower(c))  //可使用isalpha 小写为2 大写为1
         s[m++]=tolower(c);  
        else if(m!=0)  
        { s[m]='';  
          vec.push_back(s);  //在尾部加入字符串
          m=0;  
        }  
      }  
      sort(vec.begin(),vec.end());  
      for(i=0;i<vec.size();i++)  
       if(i==0 || vec[i]!=vec[i-1] )  
       cout<<vec[i]<<endl;  
    }  


  • 相关阅读:
    Selenium 元素定位方法小结
    java OpenCV挑战极验滑动拼图验证码
    使用java + selenium + OpenCV破解腾讯防水墙滑动验证码
    Java轻松破解顶象滑动拼图验证码
    Java中的chromedriver把Selenium的焦点转移到新窗口
    java 破解滑动拼图验证码(opencv+chromedriver+selenium )
    selenium+java破解极验滑块验证码
    Appium 本地编译 chromedriver 历程记录
    关闭 ChromeDriver was started successfully 提示信息
    Selenium执行完毕未关闭chromedriver/geckodriver进程的解决办法(java版)
  • 原文地址:https://www.cnblogs.com/csu-lmw/p/9124483.html
Copyright © 2011-2022 走看看