Computer_Science/leetcode/17-letter_combinations_of_a_phone_number.c~


1
2
3
4
5
6
7
8
9
10
11

/**
 * Return an array of size *returnSize.
 * Note: The returned array must be malloced, assume caller calls free().
 */
char** letterCombinations(char* digits, int* returnSize) {
	while(*digits) {
		if(*digits >= '2' && *digits <= '9') {
		} else
			return "";
	}
}