class Solution {
public:
vector<int> shortestToChar(string S, char C) {
vector<int>v1;
vector<int>ans;
for(int i = 0;i<S.size();i++)
{
if(S[i] == C) v1.push_back(i);
}
for(int i = 0;i<S.size();i++)
{
int tmp = INT_MAX;
for(int j = 0;j<v1.size();j++)
{
tmp = min(tmp,abs(v1[j]-i));
}
ans.push_back(tmp);
}
return ans;
}
};
