[LeetCode] 38. Count and Say
2016-07-20 16:36
363 查看
思路:
拿两个字符串变量循环记录结果即可. 每次遍历res字符串, 拿count变量记录连续相同字符的个数, 遇到不同的以后把count和count数的字符添加到temp串里, 最后内层循环结束别忘了把最后一组子字符串的count和字符填到temp里, 然后交换一下res和temp即可.
拿两个字符串变量循环记录结果即可. 每次遍历res字符串, 拿count变量记录连续相同字符的个数, 遇到不同的以后把count和count数的字符添加到temp串里, 最后内层循环结束别忘了把最后一组子字符串的count和字符填到temp里, 然后交换一下res和temp即可.
string countAndSay(int n) { if (! n) return ""; if (n == 1) return "1"; string res = "1", temp = ""; while (n-- > 1) { int count = 1; for (int i = 1; i < res.length(); i++) { if (res[i] == res[i - 1]) count++; else { temp += (char)(count + '0'); temp += res[i - 1]; count = 1; } } temp += (char)(count + '0'), temp += res.back(); res = ""; swap(res, temp); } return res; }
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists(合并两个排好序的单链表);leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解