shortest-to-char

shortest-to-char.py

def shortestToChar(self, S: 'str', C: 'str') -> 'List[int]':
    # store index of all chars c
    ind = []
    for i,c in enumerate(S):
        if (c == C):
         ind.append(i)

    # Find shortest distance
    # from current i to indexed c
    arr = []

    for i,s in enumerate(S):
        closestPos = min(ind, key=lambda x:abs(x-i))
        distance = abs(closestPos-i)
        arr.append(distance)
    return arr

Solution for leetcode 821. Shortest Distance to a Character