Skip to content

Files

Latest commit

Aug 2, 2024
960ed22 · Aug 2, 2024

History

History
27 lines (16 loc) · 585 Bytes

problem.md

File metadata and controls

27 lines (16 loc) · 585 Bytes

821. Shortest Distance to a Character [Rating: 1266.34]

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] and c are lowercase English letters.
  • c occurs at least once in s.