1
class Solution:
2
    def shortestToChar(self, s: str, c: str) -> List[int]:
3
        res = []
4
        ch = []
5
        for i in range(len(s)):
6
            if s[i] == c:
7
                ch.append(i)
8
        min_d = len(s)
9
        for i in range(len(s)):
10
            for j in range(len(ch)):
11
                min_d = min(min_d, abs(i - ch[j]))
12
            res.append(min_d)
13
            min_d = len(s)
14
        return res