首页 > 其他 > 详细

LeetCode Count and Say

时间:2015-03-03 15:17:02      阅读:250      评论:0      收藏:0      [点我收藏+]

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" 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 sequence.

Note: The sequence of integers will be represented as a string.

题意:统计上一个字符串中连续相同的字符的长度,求第n个

思路:单纯的模拟

class Solution {
public:
    string countAndSay(int n) {
        string ans = "1";
        for (int i = 1; i < n; i++) {
            int count = 1;
            string tmp = "";
            for (int j = 1; j < ans.size(); j++) {
                if (ans[j] == ans[j-1]) {
                    count++;
                } else {
                    tmp = tmp + (char)(count + '0') + ans[j-1];
                    count = 1;
                }
            }
            ans = tmp + (char)(count + '0') + ans[ans.size()-1];
        }

        return ans;
    }
};



LeetCode Count and Say

原文:http://blog.csdn.net/u011345136/article/details/44037151

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!