src/io/github/marwlod/boggle/BoggleSolver.java
// (You can assume the word contains only the uppercase letters A through Z.)
(You can assume the word contains only the uppercase letters A through Z.)
( You can assume the word contains only the uppercase letters A through Z . )
public int scoreOf(String word) {
        if (!dictionary.contains(word)) return 0;
        final int points;
        if (word.length() < 3) points = 0;
        else if (word.length() == 3 || word.length() == 4) points = 1;
        else if (word.length() == 5) points = 2;
        else if (word.length() == 6) points = 3;
        else if (word.length() == 7) points = 5;
        else points = 11;
        return points;
    }
public int scoreOf ( String word ) { if ( ! dictionary . contains ( word ) ) return 0 ; final int points ; if ( word . length ( ) < 3 ) points = 0 ; else if ( word . length ( ) == 3 || word . length ( ) == 4 ) points = 1 ; else if ( word . length ( ) == 5 ) points = 2 ; else if ( word . length ( ) == 6 ) points = 3 ; else if ( word . length ( ) == 7 ) points = 5 ; else points = 11 ; return points ; }
(You can assume the word contains only the uppercase letters A through Z.)
( You can assume the word contains only the uppercase letters A through Z . )