Programmation dynamique

package com.company;
import java.util.HashMap;
import java.util.Map;

public class Main {
    static String[] listOfWords = {"bo","rd","ate","t","ska","sk","boar"};

    public static void main(String[] args) {

        Map<String, String> res = new HashMap<String, String>();
        System.out.println(canConstruct("skateboard",res));

    }


    static boolean canConstruct(String word, Map<String, String> res){

        // base cases
        if (word.isEmpty()) return true;
        if (res.containsValue(word)) return res.containsValue(word);


        for (int i = 0; i < listOfWords.length; i++) {

            // if the substring is contained at the beginning of the string
            if (word.indexOf(listOfWords[i]) == 0 ){

                // update of the word
                int lengthSubString = listOfWords[i].length();
                String exWord = word;
                word = word.substring(0,lengthSubString);

                if (canConstruct(word, res) == true){
                    res.put(exWord,word);
                    return true;
                }
            }
        }

        return false;
    }
}