[LeetCode] 38. Count and Say
来源:互联网 发布:棋牌软件开发定制 编辑:程序博客网 时间:2024/06/03 16:55
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"
class Solution {public: string countAndSay(int n) { string s("1"); for (int idx = 2; idx <= n; idx++) { char c = s[0]; int pos = 0; string nxt; s.push_back('\0'); for (int i = 0; i < s.size(); i++) { if (s[i] == c) continue; nxt += to_string(i - pos); nxt.push_back(c); c = s[i]; pos = i; } s = nxt; } return s; }};
阅读全文
0 0
- [LeetCode]38.Count and Say
- LeetCode --- 38. Count and Say
- LeetCode 38.Count and Say
- [Leetcode] 38. Count and Say
- 38. Count and Say LeetCode
- 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
- vue 使用总结
- 生信脚本练习(7)求fastq文件质量值分布
- MATLAB 绘制3D Surf
- 剑指offer--对称的二叉树
- HDU-4614:Vases and Flowers(线段树+二分)
- [LeetCode] 38. Count and Say
- python requests解析
- 【Shiro】--- 简介
- POJ 2955 Brackets 区间DP
- ZOJ 1516 Uncle Tom's Inherited Land (二分图匹配)
- 【转载】机器学习计算距离和相似度的方法
- 剑指offer--按之字形顺序打印二叉树
- 引用数据类型---数组
- R