mirror of
https://github.com/devenperez/leetcode.git
synced 2026-06-13 14:57:08 +00:00
Time: 3706 ms (26.43%), Space: 14.3 MB (44.44%) - LeetHub
This commit is contained in:
@@ -5,8 +5,7 @@ class Solution(object):
|
||||
:type target: int
|
||||
:rtype: List[int]
|
||||
"""
|
||||
length = len(nums)
|
||||
for i in range(length):
|
||||
for j in range(i + 1, length):
|
||||
for i in range(len(nums)):
|
||||
for j in range(i + 1, len(nums)):
|
||||
if nums[i] + nums[j] == target:
|
||||
return [i, j]
|
||||
Reference in New Issue
Block a user