599 Minimum Index Sum of Two Lists
2017-06-09 21:09
337 查看
class Solution(object):
def findRestaurant(self, A, B):
"""
:type list1: List[str]
:type list2: List[str]
:rtype: List[str]
"""
dic={u:i for i,u in enumerate(A)}
best, ans = 10000, []
for j in range(len(B)):
if B[j] in dic:
i = dic[B[j]]
if i + j < best:
best = i + j
ans = [B[j]]
elif i + j == best:
ans.append(B[j])
return ans
找两列表中下表和最小的元素
def findRestaurant(self, A, B):
"""
:type list1: List[str]
:type list2: List[str]
:rtype: List[str]
"""
dic={u:i for i,u in enumerate(A)}
best, ans = 10000, []
for j in range(len(B)):
if B[j] in dic:
i = dic[B[j]]
if i + j < best:
best = i + j
ans = [B[j]]
elif i + j == best:
ans.append(B[j])
return ans
找两列表中下表和最小的元素
相关文章推荐
- LeetCode - 599 - Minimum Index Sum of Two Lists
- Leetcode 599 Minimum Index Sum of Two Lists
- HashTable-599-Minimum Index Sum of Two Lists
- LeetCode 599 Minimum Index Sum of Two Lists
- [LeetCode] Minimum Index Sum of Two Lists 两个表单的最小坐标和
- Minimum Index Sum of Two Lists-python
- LeetCode Minimum Index Sum of Two Lists
- Minimum Index Sum of Two Lists问题及解法
- LeetCode.599 Minimum Index Sum of Two Lists (经典:哈希表对字符串去重和List与数组间的转换)
- LC-Minimum Index Sum of Two Lists
- leetcode[Minimum Index Sum of Two Lists]//待整理多种解法
- Minimum Index Sum of Two Lists
- 599.minimum-index-sum-of-two-lists
- Partition a set of numbers into two so that difference between their sum is minimum with equal size
- #leetcode#Sum of Two Integers
- [LeetCode160] Intersection of Two Linked Lists
- [leetcode][list] Intersection of Two Linked Lists
- LeetCode--No.160--Intersection of Two Linked Lists
- leetcode 160: Intersection of Two Linked Lists
- Distribute numbers to two “containers” and minimize their difference of sum