//url:https://leetcode.com/problems/shortest-distance-to-a-character/description/
//最短的距离，取决于该位置左右两边目标C位置的距离
class Solution {
public:
    vector shortestToChar(string S, char C) {
        vector result;
        int firstMeet=-1;
        int lastMeet=-1;
        for(int i=0;i