[Leetcode]Letter Combinations of a Phone Number My Submissions Question Solution

public class Solution {
    private Map<Integer, List<String>> digitMap;
    public List<String> letterCombinations(String digits) {
        digitMap = new HashMap<>();
        digitMap.put(2,Arrays.asList(new String[] {"a","b","c"}));
        digitMap.put(3,Arrays.asList(new String[] {"d","e","f"}));
        digitMap.put(4,Arrays.asList(new String[] {"g","h","i"}));
        digitMap.put(5,Arrays.asList(new String[] {"j","k","l"}));
        digitMap.put(6,Arrays.asList(new String[] {"m","n","o"}));
        digitMap.put(7,Arrays.asList(new String[] {"p","q","r","s"}));
        digitMap.put(8,Arrays.asList(new String[] {"t","u","v"}));
        digitMap.put(9,Arrays.asList(new String[] {"w","x","y","z"}));
        
        List<String> result = new ArrayList<String>(Arrays.asList(new String[] {new String("")}));
        List<String> result2 = new ArrayList<String>();
        if(digits.length() == 0){
            return result2;
        }
        for(char digit : digits.toCharArray()){
            for(int i = 0; i < result.size(); i++) {
                String cur = result.get(i);
                for(String map : digitMap.get(digit - '0')){
                    result2.add(cur + map);
                }
            }
            List<String> temp = result;
            result = result2;
            result2 = temp;
            result2.clear();
        }
        
        return result;
    }
    
}