LeetCode 412 Fizz Buzz（字符串模拟）

Write a program that outputs the string representation of numbers from 1 to n.

But for multiples of three it should output “Fizz” instead of the number and for the multiples of five output “Buzz”. For numbers which are multiples of both three and five output “FizzBuzz”.

Example:

n = 15,

Return:
[
    "1",
    "2",
    "Fizz",
    "4",
    "Buzz",
    "Fizz",
    "7",
    "8",
    "Fizz",
    "Buzz",
    "11",
    "Fizz",
    "13",
    "14",
    "FizzBuzz"
]

题目大意：输入一个数n，返回一个n维字符串数组。数组下标i从1开始，当i能整除3时输出Fizz，i能整除5时输出Buzz，i能整除3和5时输出FizzBuzz，其他情况输出字符串i本身。

解题思路：输出字符串i本身需要sprintf函数，其他情况比较好处理，不在讨论。

代码如下：

/**
 * Return an array of size *returnSize.
 * Note: The returned array must be malloced, assume caller calls free().
 */
char** fizzBuzz(int n, int* returnSize) {
    char** ans = (char**)malloc(n * sizeof(char*));
    for(int i = 0;i < n;i++){
        ans[i] = malloc(10);
        if((i+1) % 15 == 0)     ans[i] = "FizzBuzz";
        else if((i+1) % 5 == 0) ans[i] = "Buzz";
        else if((i+1) % 3 == 0) ans[i] = "Fizz";
        else                    sprintf(ans[i],"%d",i+1);
    }
    *returnSize = n;
    return ans;
}