[LeetCode] Shortest Distance to a Character

最新推荐文章于 2024-04-20 23:30:42 发布

转载最新推荐文章于 2024-04-20 23:30:42 发布 · 54 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：https://segmentfault.com/a/1190000016078613

本文介绍了一种算法，该算法接收一个字符串S和一个字符C作为输入，并返回一个整数数组，数组中的每个元素代表从字符串S中的相应位置到字符C的最短距离。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem

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.

Solution

class Solution {
    public int[] shortestToChar(String S, char C) {
        int len = S.length();
        int[] res = new int[len];
        if (S == null || S.length() == 0) return res;
        Arrays.fill(res, 10000);
        int pre = -1;
        for (int i = 0; i < len; i++) {
            char ch = S.charAt(i);
            if (ch == C) {
                pre = i;
                res[i] = 0;
            } else {
                if (pre != -1) {
                    res[i] = i-pre;
                }
            }
        }
        pre = -1;
        for (int i = len-1; i >= 0; i--) {
            char ch = S.charAt(i);
            if (ch == C) {
                pre = i;
            } else {
                if (pre != -1) {
                    res[i] = Math.min(res[i], pre-i);
                }
            }
        }
        return res;
    }
}