[LC] Ace B

zhiwei 發(fā)布于2019-08-19 10:57 / 1623人閱讀

Problem #1 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.

Solution #1 Shortest Distance to a Character

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;
    }
}

Problem #2 Solution #2 Problem #3 Solution #3 Problem #4 Solution #4 Problem #5 Solution #5 Problem #6 Solution #6 Problem #7 Solution #7 Problem #8 Solution #8 Problem #9 Solution #9 Problem #10 Solution #10 Problem #11 Solution #11 Problem #12 Solution #12 Problem #13 Solution #13 Problem #14 Solution #14 Problem #15 Solution #15 Problem #16 Solution #16 Problem #17 Solution #17