LeetCode
#Yechim
class Solution(object):
def twoSum(self, nums, target):
ls = []
for i in range(len(n)):
for j in range(len(n)):
if i != j and nums[i]+nums[j] == target:
ls += [[i,j]]
break
return ls[0]
@python_dasturlash_t1li
#Yechim
class Solution(object):
def twoSum(self, nums, target):
ls = []
for i in range(len(n)):
for j in range(len(n)):
if i != j and nums[i]+nums[j] == target:
ls += [[i,j]]
break
return ls[0]
@python_dasturlash_t1li