Shortest Distance to a Character
Given a string s and a character c that occurs in s, return an array of integers answer where answer.length == s.length and answer[i] is the distance from index i to the closest occurrence of character c in s.
The distance between two indices i and j is abs(i - j), where abs is the absolute value function.
Example 1
Input
s = "loveleetcode", c = "e"Output
[3,2,1,0,1,0,0,1,2,2,1,0]The character
e appears at indices 3, 5, 6, and 11, and each output value is the distance from that index to the closest e.Example 2
Input
s = "aaab", c = "b"Output
[3,2,1,0]The only occurrence of
b is at index 3, so the distances from indices 0 through 3 are 3, 2, 1, and 0.Constraints
- 1 <= s.length <= 10^4
- s[i] and c are lowercase English letters.
- It is guaranteed that c occurs at least once in s.