函数式leetcode-1

python版本,2.7

class Solution(object):
def twoSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
if target % 2 == 0 :
result = []
for index,item in enumerate(nums):
if len(result) == 2:
return result
if item * 2 == target:
result.append(index)
if len(result) == 2:
return result
my_set = set(nums)
result_set = filter(lambda x:(target - x) in my_set and x * 2 != target,my_set)
num = result_set[0]
result = []
for index,item in enumerate(nums):
if len(result) == 2:
return result
if item == num or item == target - num:
result.append(index)
result.sort()
return result
if __name__ == '__main__':
test = Solution()
#result = test.twoSum([3,2,4],6)
#result = test.twoSum([0,4,3,0],0)
result = test.twoSum([2,1,9,4,4,56,90,3],8)
print(result)

最后

以上就是孝顺大碗最近收集整理的关于函数式leetcode-1的全部内容，更多相关函数式leetcode-1内容请搜索靠谱客的其他文章。