Amarkant814
diff --git a/‎February Leetcode Challenge 2021/07 closestChar.py
Copy file name to clipboard
+14Lines changed: 14 additions & 0 deletions b/‎February Leetcode Challenge 2021/07 closestChar.py
Copy file name to clipboard
+14Lines changed: 14 additions & 0 deletions
@@ -0,0 +1,14 @@
+class Solution(object):
+    def shortestToChar(self, S, C):
+        prev = float('-inf')
+        ans = []
+        for i, x in enumerate(S):
+            if x == C: prev = i
+            ans.append(i - prev)
+
+        prev = float('inf')
+        for i in xrange(len(S) - 1, -1, -1):
+            if S[i] == C: prev = i
+            ans[i] = min(ans[i], prev - i)
+
+        return ans