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.
分析:
题目是找到离给定字母最近的距离,可以先求出所有给定字母的位置,然后计算的时候遍历记录给定字母位置的数组,这里有个小技巧,如果计算的时候距离增大了,就不用再遍历下去了,直接跳出计算距离的循环即可,可以省点时间。
代码:
class Solution {
public:
inline int abs(int a)
{
if(a>0)
return a;
return -a;
}
vector<int> shortestToChar(string S, char C) {
vector<int> res(S.size());
vector<int> pos;
int temp;
for(int i=0;i<S.size();++i)
if(S[i]==C)
pos.push_back(i);
for(int i=0;i<S.size();++i)
{
res[i]=abs(pos[0]-i);
for(int j=1;j<pos.size();++j)
{
temp = abs(pos[j]-i);
if(temp>=res[i])
break;
else
res[i]=temp;
}
}
return res;
}
};