Recca Chao 的 gitHub page

推廣網站開發,包含 Laravel 和 Kotlin 後端撰寫、自動化測試、讀書心得等。Taiwan Kotlin User Group 管理員。

View on GitHub

Hi, here’s your problem today. This problem was recently asked by Uber:

Given a string s and a character c, find the distance for all characters in the string to the character c in the string s. You can assume that the character c will appear at least once in the string.

Here’s an example and some starter code:

def shortest_dist(s, c):

Fill this in.

print(shortest_dist(‘helloworld’, ‘l’))

[2, 1, 0, 0, 1, 2, 2, 1, 0, 1]