src/alphastats/AlphabeticalStatistics.java
public static boolean needsOneLetter(String word) {
		int count = 0;
		for (int i = 0; i < word.length(); i++) {
			count = Character.isUpperCase(word.charAt(i)) ? count + 1 : count;
		}
		return count == 1;
	}
/**
	 * Check if a word needs one letter before it is fully deciphered to plaintext
	 * @param word
	 * @return whether word has one upper case
	 */
Check if a word needs one letter before it is fully deciphered to plaintext
@param word
@return whether word has one upper case
Check if a word needs one letter before it is fully deciphered to plaintext @param word @return whether word has one upper case
public static boolean needsOneLetter(String word) {
		int count = 0;
		for (int i = 0; i < word.length(); i++) {
			count = Character.isUpperCase(word.charAt(i)) ? count + 1 : count;
		}
		return count == 1;
	}
public static boolean needsOneLetter ( String word ) { int count = 0 ; for ( int i = 0 ; i < word . length ( ) ; i ++ ) { count = Character . isUpperCase ( word . charAt ( i ) ) ? count + 1 : count ; } return count == 1 ; }
Check if a word needs one letter before it is fully deciphered to plaintext
 @param word
 @return whether word has one upper case
Check if a word needs one letter before it is fully deciphered to plaintext @param word @return whether word has one upper case