首页 > 其他 > 详细

Leetcode 443 String Compression

时间:2019-03-10 11:29:43      阅读:143      评论:0      收藏:0      [点我收藏+]

基础的字符串操作,用两个指针扫一遍就行.

class Solution(object):
    def compress(self,chars):
        """
        :type chars: List[str]
        :rtype: int
        """
        if not chars:
            return 0
        if len(chars) == 1:
            return 1
        left, right, num = 0, 1, 1
        while right <= len(chars):
            if right == len(chars):
                if num > 1:
                    chars[left:right] = chars[left] + str(num)
                break
            if chars[right] == chars[left]:
                num += 1
                right += 1
            elif num > 1:  # need modification
                chars[left:right] = chars[left] + str(num)
                left = left + len(chars[left] + str(num))
                right = left + 1
                num = 1
            else:
                left = right
                right = left + 1
        print(chars)
        return len(chars)

 

Leetcode 443 String Compression

原文:https://www.cnblogs.com/zywscq/p/10504034.html

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