Commit299a8b8

applewjg

committed

CountandSay

Change-Id: Id9ecbf353e2b65df40a69708115d2672b1f14360

1 parentf682fff commit299a8b8Copy full SHA for 299a8b8

File tree

+45

-0

lines changed

+45

-0

lines changed

Lines changed: 45 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,45 @@`
	`1`	`+/*`
	`2`	`+ Author: King, wangjingui@outlook.com`
	`3`	`+ Date: Dec 20, 2014`
	`4`	`+ Problem: Count and Say`
	`5`	`+ Difficulty: Easy`
	`6`	`+ Source: https://oj.leetcode.com/problems/count-and-say/`
	`7`	`+ Notes:`
	`8`	`+ The count-and-say sequence is the sequence of integers beginning as follows:`
	`9`	`+ 1, 11, 21, 1211, 111221, ...`
	`10`	`+`
	`11`	`+ 1 is read off as "one 1" or 11.`
	`12`	`+ 11 is read off as "two 1s" or 21.`
	`13`	`+ 21 is read off as "one 2, then one 1" or 1211.`
	`14`	`+ Given an integer n, generate the nth sequence.`
	`15`	`+ Note: The sequence of integers will be represented as a string.`
	`16`	`+`
	`17`	`+ Solution: ...`
	`18`	`+*/`
	`19`	`+`
	`20`	`+publicclassSolution {`
	`21`	`+publicStringcountAndSay(intn) {`
	`22`	`+StringBuffers =newStringBuffer("1");`
	`23`	`+StringBufferres =newStringBuffer();`
	`24`	`+while((--n) !=0){`
	`25`	`+res.setLength(0);`
	`26`	`+intsize =s.length();`
	`27`	`+intcnt =1;`
	`28`	`+charcur =s.charAt(0);`
	`29`	`+for(inti=1;i<size;i++){`
	`30`	`+if(s.charAt(i)!=cur){`
	`31`	`+res.append(cnt);`
	`32`	`+res.append(cur);`
	`33`	`+cur =s.charAt(i);`
	`34`	`+cnt =1;`
	`35`	`+ }else ++cnt;`
	`36`	`+ }`
	`37`	`+res.append(cnt);`
	`38`	`+res.append(cur);`
	`39`	`+StringBuffertmp =s;`
	`40`	`+s =res;`
	`41`	`+res =tmp;`
	`42`	`+ }`
	`43`	`+returns.toString();`
	`44`	`+ }`
	`45`	`+}`

Comments

(0)