Leetcode 17. Letter Combinations of a Phone Number

public class Solution {
    private static final String[] KEYS = { "", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz" };
    
    public static void backTrack(int offset, String digits, String cur, List<String> ret) {
        if (offset == digits.length()) {
            ret.add(cur);
            return;
        }
        else {
            String letters = KEYS[(digits.charAt(offset)-'0')];
            for (int i=0; i<letters.length(); i++) 
                backTrack(offset+1, digits, cur+letters.charAt(i), ret);
        }
    }
    
    public List<String> letterCombinations(String digits) {
        List<String> ret = new ArrayList<>();
        if (digits == null || digits.length() == 0) return ret;
        backTrack(0, digits, "", ret);
        return ret;
    }
}