【leetcode】第38题 Count and Say 题目+解析+代码
来源:互联网 发布:笔记本风扇调节软件 编辑:程序博客网 时间:2024/06/15 19:17
【题目】
The count-and-say sequence is the sequence of integers with the first five terms as following:
1. 12. 113. 214. 12115. 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 term of the count-and-say sequence.
Note: Each term of the sequence of integers will be represented as a string.
Example 1:
Input: 1Output: "1"
Example 2:
Input: 4Output: "1211"【解析】
n=2是把n=1读出来,n=3是把n=2读出来,n=4是把n=3读出来……m个x读作mx。
这里用的StringBuilder,原因见上一篇文章。
【代码】
class Solution { public String countAndSay(int n) { String str="1"; for(int i=1;i<n;i++) { str=countAnd(str); } return str; } public String countAnd(String str){ char m=str.charAt(0); int count=0; StringBuilder st=new StringBuilder(""); for(int i=0;i<str.length();i++) { if(str.charAt(i)==m){ count++; } else{ st.append(count).append(m); m=str.charAt(i); count=1; } } st.append(count).append(m); return st.toString(); }}
阅读全文
0 0
- 【leetcode】第38题 Count and Say 题目+解析+代码
- leetcode第38题-Count and Say
- leetcode 第38题:Count and Say
- LeetCode题目9 Count and Say
- leetcode-38-Count and Say 基础题
- [LeetCode 38] Count and Say
- LeetCode(38) Count and Say
- [leetcode 38] Count and Say
- [Leetcode] 38 - Count and Say
- leetcode-38 count and say
- [LeetCode 38]Count and Say
- LeetCode 38 Count and Say
- leetcode-38 Count and Say
- Leetcode 38 Count and Say
- Leetcode---(38)Count and Say
- leetcode 38: Count and Say
- Leetcode# 38 Count and Say
- leetcode[38]:Count and Say
- POJ 1724 ROADS bfs || dfs || A*
- WideCharToMultiByte和MultiByteToWideChar函数的用法
- 与Swagger集成的三种方式
- oracle11g dataguard 完全手册
- Django学习 (6):搭建简易博客
- 【leetcode】第38题 Count and Say 题目+解析+代码
- 《Drools7.0.0.Final规则引擎教程》第4章 Query查询之基础
- TensorFlow学习笔记(二十八)CNN的9大模型之AlexNet
- Ubuntu16.04下安装Truffle和TestRPC
- HDU 4821String(字符串hash)
- 学习笔记TF047:PlayGround、TensorBoard
- 背包入门--多重背包 hd 2079
- 在 golang 中使用 Json
- c++自定义一个动态数组vector