// StringCharactersCounted.java Copyright (c) 2006 Kari Laitinen // http://www.naturalprogramming.com // 2006-02-15 File created. // 2006-02-15 Last modification. // A solutions to Exercise 8-2. import java.util.* ; class StringCharactersCounted { public static void main( String[] not_in_use ) { Scanner keyboard = new Scanner( System.in ) ; System.out.print( "\n Please, type in a string. \n\n " ) ; String given_string = keyboard.nextLine() ; int number_of_unprintable_characters = 0 ; int number_of_digits = 0 ; int number_of_uppercase_letters = 0 ; int number_of_lowercase_letters = 0 ; int number_of_special_characters = 0 ; for ( int character_index = 0 ; character_index < given_string.length() ; character_index ++ ) { if ( given_string.charAt( character_index ) < ' ' ) { number_of_unprintable_characters ++ ; } else if ( given_string.charAt( character_index ) >= '0' && given_string.charAt( character_index ) <= '9' ) { number_of_digits ++ ; } else if ( given_string.charAt( character_index ) >= 'A' && given_string.charAt( character_index ) <= 'Z' ) { number_of_uppercase_letters ++ ; } else if ( given_string.charAt( character_index ) >= 'a' && given_string.charAt( character_index ) <= 'z' ) { number_of_lowercase_letters ++ ; } else { number_of_special_characters ++ ; } } System.out.print( "\n The given String contains \n " + number_of_unprintable_characters + " unprintable characters \n " + number_of_digits + " digits \n " + number_of_uppercase_letters + " uppercase letters \n " + number_of_lowercase_letters + " lowercase letters \n " + number_of_special_characters + " special characters \n " ) ; } }