mirror of
https://github.com/devenperez/leetcode.git
synced 2026-06-13 14:57:08 +00:00
Deleted problem 1 again
This commit is contained in:
@@ -1,11 +0,0 @@
|
|||||||
class Solution(object):
|
|
||||||
def twoSum(self, nums, target):
|
|
||||||
"""
|
|
||||||
:type nums: List[int]
|
|
||||||
:type target: int
|
|
||||||
:rtype: List[int]
|
|
||||||
"""
|
|
||||||
for i in range(len(nums)):
|
|
||||||
for j in range(i + 1, len(nums)):
|
|
||||||
if nums[i] + nums[j] == target:
|
|
||||||
return [i, j]
|
|
||||||
@@ -1 +0,0 @@
|
|||||||
|
|
||||||
Reference in New Issue
Block a user