首页 > 代码库 > Count and Say
Count and Say
题目
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"
or11
.11
is read off as"two 1s"
or21
.21
is read off as"one 2
, thenone 1"
or1211
.Given an integer n, generate the nth sequence.
Note: The sequence of integers will be represented as a string.
方法
循环求解。public String countAndSay(int n) { if (n == 0) { return null; } String str = "1"; for (int i = 1; i < n; i++) { int len = str.length(); char ch = str.charAt(0); int count = 1; StringBuilder builder = new StringBuilder(); for (int j = 1; j < len; j++) { if (str.charAt(j) == ch) { count++; } else { builder.append(count + "" + ch); ch = str.charAt(j); count = 1; } } builder.append(count + "" + ch); str = builder.toString(); } return str; }
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。