算法第15周Count and Say[easy]
来源:互联网 发布:VPN服务器端软件 编辑:程序博客网 时间:2024/05/19 06:49
Description
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"
Solution
通过题目要求,我们不难发现他的下一个字符串就是根据上一个字符串得到,注意是计算连续的数字有几个然后作为新的字符串。
我们采用for循环的方式。
class Solution {public: string countAndSay(int n) { string start = "1"; if (n == 1) return start; for (int i = 1; i < n; i++) { string temp = start; start = ""; int len = temp.length(); int count; for (int j = 0; j < len;) { count = 1; char h = temp[j]; int k = j; while (k+1 < len&& temp[k+1] == h) { k++; count++; } char c = count+48; start = start+c+h; j = k+1; } } return start; }};
阅读全文
0 0
- 算法第15周Count and Say[easy]
- (算法分析Week4)Count and Say[Easy]
- 38. Count and Say Easy
- 15算法课程 38. Count and Say
- [Leetcode 38, Easy] Count and Say
- <LeetCode><Easy> 38 Count and Say
- Easy-题目50:38. Count and Say
- 38. Count and Say [easy] (Python)
- Leetcode 38. Count and Say (Easy) (cpp)
- Easy 38题 Count and Say
- Easy 11 Count and Say(38)
- Easy 12 Count and Say(53)
- Count and say[easy on LeetCode]
- 算法课第1周第3题——38. Count and Say
- 第39题 Count and Say
- leetcode第38题-Count and Say
- leetcode 第38题:Count and Say
- [LeetCode] 038. Count and Say (Easy) (C++/Python)
- 「佛系」程序员:我在公司,带发修行...
- 互联网行业薪酬分析!
- Java实现发送Get和Post请求
- Jupyther notebook技巧
- Spring+Struts+Hibernate理解
- 算法第15周Count and Say[easy]
- 学习记录8
- Get!程序员必须要掌握的“职场黑话”!
- Python实现决策树(ID3、C4.5)
- 那些说「程序员」的穿搭丑爆的?看完这篇我们再聊!
- 运维新手 | 如何快速轻松记住 Linux 命令?
- 前端能力学习进度
- react里使用less时antd报错
- Code Control MVC框架-保存和加载模型