-
Notifications
You must be signed in to change notification settings - Fork 30
/
Copy pathCountandSay.cs
executable file
·66 lines (63 loc) · 3.12 KB
/
CountandSay.cs
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
// Source : https://leetcode.com/problems/count-and-say/
// Author : codeyu
// Date : Monday, October 17, 2016 7:38:57 PM
/**********************************************************************************
*
* The count-and-say sequence is the sequence of integers beginning as follows:
* 1, 11, 21, 1211, 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 sequence.
*
*
*
* Note: The sequence of integers will be represented as a string.
*
*
*
**********************************************************************************/
using System;
using System.Collections.Generic;
using Algorithms.Utils;
namespace Algorithms
{
public class Solution038
{
public static string CountAndSay(int n)
{
string s = "1";
for (int i = 1; i < n; i++)
{
s = Cal(s);
}
return s;
}
static string Cal(string s)
{
string ans = "";
int cnt =1;
int len = s.Length;
for (int i = 0; i < len; i++)
{
if (i + 1 < len && s[i] != s[i + 1])
{
ans = ans + cnt.ToString() + s[i];
cnt = 1;
}
else if (i + 1 < len)
{
cnt++;
}
}
ans = ans + cnt.ToString() + s[len-1];
return ans;
}
}
}