Given a string s
and a character c
that occurs in s
, return an array of integers answer
whereanswer.length == s.length
and answer[i]
is the shortest distance from s[i]
to the character c
in s
.
Example 1:
Input: s = "loveleetcode", c = "e"
Output: [3,2,1,0,1,0,0,1,2,2,1,0]
Example 2:
Input: s = "aaab", c = "b"
Output: [3,2,1,0]
Constraints:
- 1 <= s.length <= 104
s[i]
andc
are lowercase English letters.c
occurs at least once ins
.