[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.

代码:

#include<limits.h>
#include<algorithm>
class Solution {
public:
    vector<int> shortestToChar(string S, char C) {
        vector<int> site;
        site.push_back(-10000000);
        for(int i = 0; i < S.size(); i++){
            if(S[i] == C)
                site.push_back(i);
        }
        site.push_back(10000000);
        int index = 0;
        vector<int> res;
        for(int i = 0; i < S.size(); i++){
            if(i >= site[index+1]) index += 1;
            res.push_back(min(abs(i-site[index]), abs(site[index+1]-i)));
        }
        return res;
    }
};

阅读更多
想对作者说点什么?

博主推荐

换一批

没有更多推荐了,返回首页