Jleetcode/fizzbuzz.c at master · BeyondSword/Jleetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
char** fizzBuzz(int n, int* returnSize) {
	char* array[n + 1];
	int i;
	int length;

	length = 3;
	array[0] = malloc(length);
	*returnSize += length;
	memcpy(array[0],"[\n",3);
	for(i = 1; i<=n; i++)
	{
		if(!(i % 3 | i % 5))
		{
			length = 12;
			array[i] = malloc(length);
			if(i == n)
			{
				memcpy(array[i], "\tFizzBuzz\n", length - 1);
						*returnSize += length;
				continue;
			}
			memcpy(array[i], "\tFizzBuzz,\n", length);
		}
		else if(!(i%3))
		{
			length = 8;
			array[i] = malloc(length);
			if(i == n)
			{
				memcpy(array[i], "\tFizz\n", length-1);
						*returnSize += length;
				continue;
			}
			memcpy(array[i], "\tFizz,\n", length);
		}
		else if(!(i%5))
		{
			length = 8;
			array[i] = malloc(length);
			if(i == n)
			{
				memcpy(array[i], "\tBuzz\n", length-1);
						*returnSize += length;
				continue;
			}
			memcpy(array[i], "\tBuzz,\n", length);
		}
		else
		{
			length = (i/10 + 1) + 4;
			array[i] = malloc(length);
			if(i == n)
			{
				snprintf(array[i], length-1, "\t%d\n", i);
						*returnSize += length;
				continue;
			}
			snprintf(array[i], length, "\t%d,\n", i);
		}
		*returnSize += length;
	}

	length = 3;
	array[n + 1] = malloc(length);
	memcpy(array[n + 1], "]\n", length);
	*returnSize += length;

	return array;
}

int main()
{
	int n;
	int returnSize;
	char** p;
	scanf("%d", &n);
	p = fizzBuzz(n, &returnSize);
	return 0;
}