forked from rampatra/Algorithms-and-Data-Structures-in-Java
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCountAndSay.java
47 lines (40 loc) · 1.16 KB
/
CountAndSay.java
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
package com.leetcode.strings;
/**
* Problem: https://leetcode.com/problems/count-and-say/
*
* @author rampatra
* @since 2019-04-20
*/
public class CountAndSay {
/**
* Time complexity:
* Runtime: <a href="https://leetcode.com/submissions/detail/223728660/">1 ms</a>.
*
* @param n
* @return
*/
public static String countAndSay(int n) {
if (n == 1) return "1";
String s = countAndSay(n - 1);
StringBuilder sb = new StringBuilder();
int count = 0;
for (int i = 0; i < s.length(); i++) {
count++;
if (i + 1 >= s.length() || s.charAt(i) != s.charAt(i + 1)) {
sb.append(count);
sb.append(s.charAt(i));
count = 0;
}
}
return sb.toString();
}
public static void main(String[] args) {
System.out.println(countAndSay(1));
System.out.println(countAndSay(2));
System.out.println(countAndSay(3));
System.out.println(countAndSay(4));
System.out.println(countAndSay(5));
System.out.println(countAndSay(6));
System.out.println(countAndSay(10));
}
}