给你一个整数 n ,找出从 1 到 n 各个整数的 Fizz Buzz 表示,并用字符串数组 answer(下标从 1 开始)返回结果,其中:
answer[i] == "FizzBuzz" 如果 i 同时是 3 和 5 的倍数。
answer[i] == "Fizz" 如果 i 是 3 的倍数。
answer[i] == "Buzz" 如果 i 是 5 的倍数。
answer[i] == i (以字符串形式)如果上述条件全不满足。
示例 1:
输入:n = 3
输出:["1","2","Fizz"]
示例 2:
输入:n = 5
输出:["1","2","Fizz","4","Buzz"]
示例 3:
输入:n = 15
输出:["1","2","Fizz","4","Buzz","Fizz","7","8","Fizz","Buzz","11","Fizz","13","14","FizzBuzz"]
提示:
1 <= n <= 104
思路:
就是简单的模拟,我觉得难点就是二维数组的使用,然后麻烦的地方就是整数转为字符串。
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
char ** fizzBuzz(int n, int* returnSize){
char **ans = (char **)malloc(sizeof(char *) * n);//使用二维数组保存字符串
char str[10];
*returnSize = n; //返回的字符串的数量为 n
for(int i = 1; i <= n; i++){ //模拟
ans[i - 1] = malloc(10);
if(i % 3 == 0 && i % 5 == 0){
strcpy(ans[i-1], "FizzBuzz");
}else if(i % 3 == 0){
strcpy(ans[i-1],"Fizz");
}else if(i % 5 == 0){
strcpy(ans[i-1], "Buzz");
}else{
memset(str, 0, 10);
int j = i, k = 0;
while(j){ //从低位到高位将数字转换为字符
str[k++] = j % 10 + '0';
j /= 10;
}
j = 0;
char ch;
while(j < k){ //三杯水交换,需要讲上一步得到的字符串反转
ch = str[j];
str[j++] = str[k -1];
str[k - 1] = ch;
k--;
}
strcpy(ans[i - 1], str);
}
}
return ans;
}