LeetCode //C - 412. Fizz Buzz

412. Fizz Buzz

Given an integer n, return a string array answer (1-indexed) where:

  • answeri == "FizzBuzz" if i is divisible by 3 and 5.
  • answeri == "Fizz" if i is divisible by 3.
  • answeri == "Buzz" if i is divisible by 5.
  • answeri == i (as a string) if none of the above conditions are true.
Example 1:

Input: n = 3
Output: "1","2","Fizz"

Example 2:

Input: n = 5
Output: "1","2","Fizz","4","Buzz"

Example 3:

Input: n = 15
Output:

"1","2","Fizz","4","Buzz","Fizz","7","8","Fizz","Buzz","11","Fizz","13","14","FizzBuzz"

Constraints:
  • 1 < = n < = 1 0 4 1 <= n <= 10^4 1<=n<=104

From: LeetCode

Link: 412. Fizz Buzz


Solution:

Ideas:

1. Memory Allocation:

  • The function returns an array of strings, so we first allocate memory for the array result that will hold the strings.
  • Each string requires memory allocation separately. Since the maximum string length is 8 characters (for "FizzBuzz") plus 1 for the null terminator (\0), we allocate space for each string using malloc(9 * sizeof(char)).

2. FizzBuzz Logic:

  • For each number from 1 to n, we check:
    • If the number is divisible by both 3 and 5, we assign "FizzBuzz".
    • If it's divisible by only 3, we assign "Fizz".
    • If it's divisible by only 5, we assign "Buzz".
    • Otherwise, we convert the number to a string using snprintf and store it in the array.

3. Returning the Result:

  • The function returns the result array, and the size of the array (n) is returned through the returnSize pointer.
  • The main function demonstrates how to call this function and free the allocated memory properly.
Code:
c 复制代码
/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
char** fizzBuzz(int n, int* returnSize) {
    *returnSize = n;
    char** result = (char**)malloc(n * sizeof(char*)); // Allocate memory for the result array

    for (int i = 1; i <= n; i++) {
        result[i - 1] = (char*)malloc(9 * sizeof(char)); // Allocate memory for each string (maximum length is 8 for "FizzBuzz" + 1 for '\0')

        if (i % 3 == 0 && i % 5 == 0) {
            strcpy(result[i - 1], "FizzBuzz");
        } else if (i % 3 == 0) {
            strcpy(result[i - 1], "Fizz");
        } else if (i % 5 == 0) {
            strcpy(result[i - 1], "Buzz");
        } else {
            snprintf(result[i - 1], 9, "%d", i); // Convert the integer to a string
        }
    }

    return result;
}
相关推荐
v_34836087628 小时前
Android native端 堆栈打印
android·算法
residual_fan8 小时前
【学术论文】航空发动机故障诊断智能体:基于持续对比强化学习的动态优化方法
人工智能·算法·数据挖掘·数据分析
GreenTea9 小时前
OpenAI Agents API 上手实测:一次调用把整个 agent loop 甩给 OpenAI
前端·后端·算法
深圳满意度咨询10 小时前
医院满意度数字化测评系统:从数据采集到智能决策的技术实践
算法
xiangyun6111 小时前
【408数据结构 08】队列:循环队列判空判满,408年年考,一次讲清
c语言·开发语言·数据结构·c++·算法
xiangyun6111 小时前
【408数据结构 06】双链表、循环链表、静态链表
c语言·开发语言·数据结构·c++·算法
302wanger13 小时前
推荐下我的两个AI信息源
算法
索尔~古德曼13 小时前
CF——错题的集合
算法
SL_staff13 小时前
JVS-Logic:从页面配置工具到企业级业务逻辑中枢的技术演进
java·算法·全栈
Logic10113 小时前
C语言/数据结构数组题解:数字列表加一(Plus One)——进位处理与数组扩展
c语言·数据结构·模拟·数组·时间复杂度·算法题·进位