码迷,mamicode.com
首页 > 其他好文 > 详细

LeetCode Count and Say 解题报告

时间:2014-12-05 15:33:13      阅读:121      评论:0      收藏:0      [点我收藏+]

标签:leetcode解题报告   算法   面试题   java   

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.

https://oj.leetcode.com/problems/count-and-say/
如何数(shu 三声) 数(shu 四声)
1,11,21,1211,111221,312211,13112221,1113213211


先上AC代码,

public class Solution {
    String countAndSayForOneString(String input) {
        char tmp = input.charAt(0);
        int  num = 1;
        StringBuffer newString = new StringBuffer("");
        for(int k=1;k<input.length();k++) {
            if(input.charAt(k)==tmp) {
        		num++;
        		continue;
        	}
        	newString.append(Integer.toString(num) + tmp);
        	tmp = input.charAt(k);
        	num = 1;
        }
        newString.append(Integer.toString(num) + tmp);
        return newString.toString();
    }
    
    public String countAndSay(int n) {
        String result = "1";
		int i = 1;
		while(i<n) {
        	result = countAndSayForOneString(result);
    		i++;
        }
		return result;
    }
}


LeetCode Count and Say 解题报告

标签:leetcode解题报告   算法   面试题   java   

原文地址:http://blog.csdn.net/worldwindjp/article/details/41747749

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!