首页 > itarticle > [leetcode] problem 821 – shortest distance to a character

[leetcode] problem 821 – shortest distance to a character

admin 11月 13, 2020 0

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

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.

Code

public int[] shortestToChar(String S, char C) {
    int n = S.length();
    int[] result = new int[n];
    Arrays.fill(result, n);

    for (int i = 0; i < n; i++) {
        if (S.charAt(i) == C)
            result[i] = 0;
        else if (i > 0)
            result[i] = result[i - 1] + 1;
    }

    for (int i = n - 2; i >= 0; i--)
        result[i] = Math.min(result[i], result[i + 1] + 1);

    return result;
}