leetcode 821. Shortest Distance to a Character

leetcode 821. Shortest Distance to a Character

原题地址：https://leetcode.com/problems/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:

• S string length is in [1, 10000].
• C is a single character, and guaranteed to be in string S.
• All letters in S and C are lowercase.

python代码

class Solution:
    def shortestToChar(self, S, C):
        """
        :type S: str
        :type C: str
        :rtype: List[int]
        """
        a = [-1 for i in range(len(S))]
        S = list(S)
        for i in range(len(S)):
            if C in S[i:]:
                left = S[i:].index(C)
            else:
                left = i
            if C in S[:i+1]:
                right = S[:i+1][::-1].index(C) 
            else:
                right = left
            a[i] = min(left, right)
        return a

版权声明：转载注明 http://blog.csdn.net/birdreamer/article/details/80041136