# [Leetcode] 821. Shortest Distance to a Character 解题报告

Given a string S and a character C, return an array of integers representing the shortest distance from the character C in the string.

Example 1:

Input: S = "loveleetcode", C = 'e'
Output: [3, 2, 1, 0, 1, 0, 0, 1, 2, 2, 1, 0]


Note:

1. S string length is in [1, 10000].
2. C is a single character, and guaranteed to be in string S.
3. All letters in S and C are lowercase.

class Solution {
public:
vector<int> shortestToChar(string S, char C) {
vector<int> ans(S.length(), INT_MAX);
vector<int> indices;    // the indices in which the character is C
indices.push_back(-1);
for (int i = 0; i < S.length(); ++i) {
if (S[i] == C) {
indices.push_back(i);
ans[i] = 0;
}
}
indices.push_back(S.length());
for (int i = 1; i + 1 < indices.size(); ++i) {
// update left
for (int j = indices[i] - 1; j > indices[i - 1]; --j) {
ans[j] = min(ans[j], ans[j + 1] + 1);
}
// update right
for (int j = indices[i] + 1; j < indices[i + 1]; ++j) {
ans[j] = min(ans[j], ans[j - 1] + 1);
}
}
return ans;
}
};

• 广告
• 抄袭
• 版权
• 政治
• 色情
• 无意义
• 其他

120