FilesExpand file tree

 master

/

CountandSay.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

45 lines (42 loc) · 1.27 KB

 master

/

CountandSay.java

Top

File metadata and controls

• Code
• Blame

45 lines (42 loc) · 1.27 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

/*

Author: King, wangjingui@outlook.com

Date: Dec 20, 2014

Problem: Count and Say

Difficulty: Easy

Source: https://oj.leetcode.com/problems/count-and-say/

Notes:

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.

Solution: ...

*/

public class Solution {

public String countAndSay(int n) {

StringBuffer s = new StringBuffer("1");

StringBuffer res = new StringBuffer();

while((--n) != 0){

res.setLength(0);

int size = s.length();

int cnt = 1;

char cur = s.charAt(0);

for(int i=1;i<size;i++){

if(s.charAt(i)!=cur){

res.append(cnt);

res.append(cur);

cur = s.charAt(i);

cnt = 1;

}else ++cnt;

}

res.append(cnt);

res.append(cur);

StringBuffer tmp = s;

s = res;

res = tmp;

}

return s.toString();

}

}