Day1 - Aug.22
Two Sum 问题:
Given an array of integers, return indices of the two numbers such that they add up to a specific target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
Example
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
Solution_1:Brute Froce
class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:
if len(nums) <2:
return None
else:
l = 0
r = 1
while l<r and r<= len(nums)-1:
if nums[l] + nums[r] == target:
return [l, r]
else:
r += 1
if r > len(nums)-1:
l += 1