problems/letter-combinations-of-a-phone-number

import java.util.ArrayList;
import java.util.List;

public class test1 {
	static int len=0;
	static char[] digitList;
	static String [] letters= {"abc","def","ghi","jkl","mno","pqrs","tuv","wyxz"};
	static List<String> result=new ArrayList<>();
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		String digit="23";
	    digitList=digit.toCharArray();
		len=digit.length();
		mycombination(-1,new StringBuilder().append(""));
		for (String string : result) {
			System.out.println(string);
		}
//		System.out.println((char)((97+1)+0));
	}
	public static void mycombination(int position,StringBuilder stringBuilder) {
		if (position==len-1)
		{
			result.add(stringBuilder.toString());
			return;
		}
		else {
			int y=digitList[position+1]-48-2;
			String s=letters[y];
			for (char c : s.toCharArray()) {
				mycombination(position+1, stringBuilder.append(String.valueOf(c)));stringBuilder.deleteCharAt(stringBuilder.length()-1);
			}
		}
	}
}