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