zoukankan      html  css  js  c++  java
  • 【leetcode❤python】 38. Count and Say

    #-*- coding: UTF-8 -*-
    class Solution(object):
        def countAndSay(self, n):
            """
            :type n: int
            :rtype: str
            """
            n=n-1
            if n==0:return str(1)
            tag=1;stri=str(11)
            while tag<n:
                cur=stri;j=0
                tmps=''
                while j<len(cur):
                    count=1;m=j+1
                    while m<len(cur):
                        if cur[j]==cur[m]:
                            count+=1;m+=1
                        else:break
                    tmp=str(count)+str(cur[j])
                    j=m

                    tmps+=tmp
                stri=tmps;tag+=1
            return stri

    sol=Solution()
    print sol.countAndSay(6)

                        
                    
                    
               

  • 相关阅读:
    NYOJ 205
    NYOJ 187
    NYOJ 105
    NUOJ 88
    NYOJ 70
    LL(1)算法
    MATLAB的一些基础知识
    Ubuntu raid5+lvm实验
    空间滤波
    认识weblogic的各个机构
  • 原文地址:https://www.cnblogs.com/kwangeline/p/6059538.html
Copyright © 2011-2022 走看看