LeetCode题库1046.最后一块石头的重量；1672.最富有客户的资产总量；830.较大分组的位置

class Solution(object):
    def lastStoneWeight(self, stones):
        if len(stones)==1:
            return stones[0]    //如果长度为1，返回0
        while True:
            stones.sort()
            if stones [-1]==0:
                return 0
            elif stones[-2]==0:
                return stones[-1]
            else:
                stones[-1]-=stones[-2]
                stones[-2]=0

class Solution(object):
    def maximumWealth(self, accounts):
        m=len(accounts)
        max_num=0
        if m<=50:
            for i in accounts:
                if  len(i)>=1:
                    total_num=0
                    for j in i:
                        total_num+=j
                        if total_num>max_num:
                            max_num=total_num
        return max_num

class Solution(object):
    def LargeGroupPositions(self, s):
        start, end = 0, 0
        count = 1  # 当前字母个数
        flag = s[0]
        result = []  # 存放结果
        i = 0
        for i in range(1, len(s)):  # 遍历字符串
            if s[i] == flag:
                count += 1
                # i += 1
                end = i
            # elif count >= 3:
            #     result.append([start, end])
            elif s[i] != flag:  # 如果标志位和s[i]不相等，判断是否大于等于3
                if count >= 3:
                    result.append([start, end])     # 大于则输出该结果
                    count = 1   # 计数重置为1
                    start, end = i, i
                elif count < 3:     # 小于3
                    count = 1   # 计数重置
                    flag = s[i]     # 更新标志位
                    start, end = i, i
        if count >= 3:  # 如果标志位与s[i]相等，且大于3，直接输出结果
            result.append([start, end])
        return result


# a = Solution()
# result = a.LargeGroupPositions(s='aaarddddd')
# print(result)
# 这三句在LeetCode上面可删除，在pycharm上面运行需要添加