UVA10815 Andy's First Dictionary

本文主要是介绍UVA10815 Andy's First Dictionary，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

yiyi:大概意思是输入一个文本，然后把它按照字典序排好再输出。

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 DisneylandTwo 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

 答案：

#include <stdio.h>
#include <string.h>
#include <cctype>//#include <stdlib.h>  
//#include <algorithm> 
#include <iostream>
using namespace std;
int main () {char temp[200], ch;char word[5000][200];int flags = 0,k = 0, count = 0;while ((ch = getchar()) != EOF) {//判断是不是字母if (isalpha(ch)) {temp[k++] = tolower(ch);flags = 1;}else {if (flags) {//已读取完一个单词temp[k] = '\0';flags = 0;k = 0;int term, i = 0, j;while (i < count && (term = strcmp(temp, word[i])) > 0) //找出插入的位置i++;if (i == count) {strcpy(word[i], temp);count++;}else if (!term) //相等的字符串continue;else {for ( j = count; j > i; j--) {strcpy(word[j], word[j-1]);}strcpy(word[j], temp);count++;}}}}for (int a = 0; a < count; a++) {printf("%s\n", word[a]);}//system("pause");return 0;
}

这篇关于UVA10815 Andy's First Dictionary的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---