leetcode 821. Shortest Distance to a Character 字符的最短距离-耗时100%

Problem: 821. Shortest Distance to a Character 字符的最短距离

解题过程

耗时100%，拿到c的所有索引，然后对每个字符的索引，求出差的绝对值的最小值

Code

class Solution { public: vector<int> shortestToChar(string s, char c) { vector<int> tr; for(int i = 0; i < s.size(); i++) { if(s[i] == c) { tr.push_back(i); } } vector<int> ret; for(int i = 0; i < s.size(); i++) { if(s[i] == c) ret.push_back(0); else { int mi = INT_MAX, dis; for(int j = 0; j < tr.size(); j++) { dis = abs(tr[j] - i); mi = min(dis, mi); } ret.push_back(mi); } } return ret; } };