isCryptSolution.java

/*
A cryptarithm is a mathematical puzzle for which the goal is to find the correspondence between letters and digits, such that the given arithmetic equation consisting of letters holds true when the letters are converted to digits.

You have an array of strings crypt, the cryptarithm, and an an array containing the mapping of letters and digits, solution. The array crypt will contain three non-empty strings that follow the structure: [word1, word2, word3], which should be interpreted as the word1 + word2 = word3 cryptarithm.

If crypt, when it is decoded by replacing all of the letters in the cryptarithm with digits using the mapping in solution, becomes a valid arithmetic equation containing no numbers with leading zeroes, the answer is true. If it does not become a valid arithmetic solution, the answer is false.

Example

For crypt = ["SEND", "MORE", "MONEY"] and

solution = [['O', '0'],
            ['M', '1'],
            ['Y', '2'],
            ['E', '5'],
            ['N', '6'],
            ['D', '7'],
            ['R', '8'],
            ['S', '9']]
the output should be
isCryptSolution(crypt, solution) = true.

When you decrypt "SEND", "MORE", and "MONEY" using the mapping given in crypt, you get 9567 + 1085 = 10652 which is correct and a valid arithmetic equation.

For crypt = ["TEN", "TWO", "ONE"] and

solution = [['O', '1'],
            ['T', '0'],
            ['W', '9'],
            ['E', '5'],
            ['N', '4']]
the output should be
isCryptSolution(crypt, solution) = false.

Even though 054 + 091 = 145, 054 and 091 both contain leading zeroes, meaning that this is not a valid solution.
*/

boolean isCryptSolution(String[] crypt, char[][] solution) {
    long first = 0;
    long second = 0;
    long third = 0;
    boolean sol = false;
    for(int i = 0; i < crypt.length; i++){
        String tmp = "";
        for(int j = 0; j < crypt[i].length(); j++){
            for(int k = 0; k < solution.length; k++){
                if(crypt[i].charAt(j) == solution[k][0]){
                    if(solution[k][1] == '0' && j == 0 && crypt[i].length() > 1){
                        return false;
                    }
                    tmp += solution[k][1];
                }
            }
        }
        if(i == 0){
            first = Long.parseLong(tmp);
            tmp = "";
        }
        if(i == 1){
            second = Long.parseLong(tmp);
            tmp = "";
        }
        if(i == 2){
            third = Long.parseLong(tmp);
            tmp = "";
        }
    }
    if(first + second == third){
        sol = true;
    }
    return sol;
}