mirror of
https://github.com/devenperez/leetcode.git
synced 2026-06-13 14:57:08 +00:00
Time: 3 ms (98.17%), Space: 7.2 MB (14.21%) - LeetHub
This commit is contained in:
@@ -0,0 +1,23 @@
|
||||
/**
|
||||
* Note: The returned array must be malloced, assume caller calls free().
|
||||
*/
|
||||
char ** fizzBuzz(int n, int* returnSize){
|
||||
char **array = malloc(n * sizeof(char *));
|
||||
*returnSize = n;
|
||||
|
||||
for (int i = 1; i <= n; ++i) {
|
||||
if (i % 15 == 0) {
|
||||
array[i - 1] = "FizzBuzz";
|
||||
} else if (i % 3 == 0) {
|
||||
array[i - 1] = "Fizz";
|
||||
} else if (i % 5 == 0) {
|
||||
array[i - 1] = "Buzz";
|
||||
} else {
|
||||
array[i - 1] = malloc((int) (ceil(log10(i + 1)) + 1) * sizeof(char));
|
||||
sprintf(array[i - 1], "%d", i);
|
||||
}
|
||||
}
|
||||
|
||||
return array;
|
||||
|
||||
}
|
||||
Reference in New Issue
Block a user