题目:
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:
S
string length is in[1, 10000].
C
is a single character, and guaranteed to be in stringS
.- All letters in
S
andC
are lowercase.
思路:
练手题目:我们首先统计出C字符所出现的所有位置,然后对于每个位置,分别向左和向右更新它到该位置的距离。为了统一处理,我们在indices的开头和末尾分别加入0和S.length()。
有意思的是,如果写出下面的代码之后,面试官问算法的时间复杂度是多少?答案是O(n),其中n是字符串的长度。为什么呢?因为代码中虽然有两重循环,但是每个位置最多被check两次,所以总体而言,时间复杂度是O(n)。
代码:
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;
}
};