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:

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

题解：

The idea is find nearest C, it could be left or right.

Then we could calculate left distance and right distance and take smaller one.

First left side, if there is no left one, distance is defaulted to be maximum. Here it is i+n. n is the length of S.

Then right side, update the res with smaller distance.

Time Complexity: O(n). n = S.length().

Space: O(n). res space.

AC Java:

class Solution {
    public int[] shortestToChar(String S, char C) {
        int n = S.length();
        int [] res = new int[n];
        int po = -n;
        for(int i = 0; i<n; i++){
            if(S.charAt(i) == C){
                po = i;
            }
            
            res[i] = i-po;
        }
        
        for(int i = n-1; i>=0; i--){
            if(S.charAt(i) == C){
                po = i;
            }
            
            res[i] = Math.min(res[i], Math.abs(po-i));
        }
        
        return res;
    }
}

类似One or two passes from left to right/right to left. Maximum Subarray, Maximum Product Subarray, Best Time to Buy and Sell Stock, Product of Array Except Self, Daily Temperatures, Longest Mountain in Array, Max Chunks To Make Sorted, Max Chunks To Make Sorted II.

跟上Push Dominoes.