-
Notifications
You must be signed in to change notification settings - Fork 31
/
Copy path38. Count and Say.c
84 lines (62 loc) · 1.4 KB
/
38. Count and Say.c
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
83
84
/*
38. Count and Say
The count-and-say sequence is the sequence of integers with the first five terms as following:
1. 1
2. 11
3. 21
4. 1211
5. 111221
1 is read off as "one 1" or 11.
11 is read off as "two 1s" or 21.
21 is read off as "one 2, then one 1" or 1211.
Given an integer n, generate the nth term of the count-and-say sequence.
Note: Each term of the sequence of integers will be represented as a string.
Example 1:
Input: 1
Output: "1"
Example 2:
Input: 4
Output: "1211"
*/
char* countAndSay(int n) {
char *s, *d, *x;
int i, c;
if (!n) return NULL;
#define BUF_SIZE 100 * 1024
s = malloc(BUF_SIZE);
x = d = malloc(BUF_SIZE);
s[0] = '1';
s[1] = 0;
while (n > 1) {
c = 1;
for (i = 0; s[i]; i ++) {
if (s[i] != s[i+1]) {
sprintf(x, "%d%c", c, s[i]);
x += strlen(x);
c = 1;
} else {
c ++;
}
}
x = s;
s = d;
d = x;
n --;
}
free(d);
return s;
}
/*
Difficulty:Easy
Total Accepted:145.1K
Total Submissions:418.7K
Companies Facebook
Related Topics String
Similar Questions
Encode and Decode Strings
*/