1 /*
 2  * Program to prompt the user for a punctuation free sentence consisting of at
 3  * least a few words from the standard input stream, and then print the words 
 4  * in the sentence, other than that which comes forst alphabetically and that 
 5  * which comes last alphabetically, in the order in which they were presented 
 6  * on the input stream, one word per line.
 7  */
 8 package review;
 9 
10 import java.util.ArrayList;
11 import java.util.Scanner;
12 
13 /**
14  *
15  * @author notebook
16  */
17 public class NonextremeWords {
18 
19     /**
20      * @param args the command line arguments
21      */
22     public static void main(String[] args) {
23         System.out.print("Sentence?  ");
24         Scanner scanner = new Scanner(System.in);
25         ArrayList<String> words = new ArrayList<>();
26         String sentence = scanner.nextLine();
27         String[] word = sentence.split(" ");
28         for (int a = 0; a < word.length; a = a + 1) {
29             words.add(word[a]);
30         }
31         compareWords(words);
32         for (int x = 0; x < words.size(); x = x + 1) {
33             System.out.println(words.get(x));
34         }
35     }
36 
37     private static void compareWords(ArrayList<String> words) {
38         String biggest = "aaaaa";
39         for ( int c = 0; c < words.size(); c = c + 1 ) {
40             if (words.get(c).compareTo(biggest) > 0) {
41                 biggest = words.get(c);
42             }
43         }
44         for (int d = 0; d < words.size(); d = d + 1) {
45             if (words.get(d).equalsIgnoreCase(biggest)) {
46                 words.remove(d);
47                 d = d - 1;
48             }
49         }
50         String smallest = "zzzzz";
51         for ( int c = 0; c < words.size(); c = c + 1 ) {
52             if (words.get(c).compareTo(smallest) < 0) {
53                 smallest = words.get(c);
54             }
55         }
56         for (int d = 0; d < words.size(); d = d + 1) {
57             if (words.get(d).equalsIgnoreCase(smallest)) {
58                 words.remove(d);
59                 d = d - 1;
60             }
61         }
62     }
63 
64 }
65