파이썬 릿코드 LEETCODE 1578. Minimum Deletion Cost to Avoid Repeating Letters

O(n)

class Solution(object):
    def minCost(self, s, cost):
        sum = 0
        i = 1
        bi = 0
        while(i < len(s)):
            if(s[bi] == s[i]):
                if(cost[bi] < cost[i]):
                    sum += cost[bi]
                    bi = i
                else:
                    sum += cost[i]
            else:
                bi = i
            i += 1
        return sum