leetcode 821字符的最短距离
2019-01-24 13:57
507 查看
题目:
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.
题解:
思路:可以用广搜,也可以前后遍历数组来得到最终结果:
n=len(S)
res,pos=
*n,-n
for i in range(n)+range(n)[::-1]:
if S[i]==C:pos=i
res[i]=min(res[i],abs(i-pos))
return res
在python3中应该使用list(range(n))+list(range(n)[::-1])来代替,否则不能正常工作,这是因为在python3中range是使用迭代器来生成数字的
相关文章推荐
- leetcode - 821 - 字符的最短距离
- LeetCode 821 字符的最短距离
- [LeetCode] 72. Edit Distance(最短编辑距离)
- LeetCode 243. Shortest Word Distance (最短单词距离)$
- 每天一道LeetCode-----在字符串s中找到最短的包含字符串t中所有字符的子串,子串中字符顺序无要求且可以有其他字符
- [LeetCode] 72. Edit Distance(最短编辑距离)
- [LeetCode] 317. Shortest Distance from All Buildings 建筑物的最短距离
- [LeetCode] Shortest Word Distance 最短单词距离
- LeetCode 245. Shortest Word Distance III (最短单词距离之三) $
- [LeetCode]Word Ladder 字符串的最短转换距离 (Dijkstra)
- [leetcode 244] Shortest Word Distance II------------字典中两个字符串的最短距离
- [LeetCode] Shortest Distance from All Buildings 建筑物的最短距离
- [LeetCode]-Triangle 求三角形中从顶到底最短距离
- [LeetCode] Shortest Word Distance II 最短单词距离之二
- LeetCode 317. Shortest Distance from All Buildings(最短建筑距离)
- [LeetCode] 243. Shortest Word Distance 最短单词距离
- LeetCode 243. Shortest Word Distance(单词最短距离)
- [LeetCode] 245. Shortest Word Distance III 最短单词距离 III
- LeetCode-243:Shortest Word Distance (单词最短距离)
- LeetCode 244. Shortest Word Distance II(最短单词距离)