https://leetcode.com/problems/two-sum-iii-data-structure-design/description/
Design and implement a TwoSum class. It should support the following operations: add
and find
.
add
- Add the number to an internal data structure.find
- Find if there exists any pair of numbers which sum is equal to the value.
Example 1:
add(1); add(3); add(5); find(4) -> true find(7) -> false
Example 2:
add(3); add(1); add(2); find(3) -> true find(6) -> false
class TwoSum(object):
def __init__(self):
"""
Initialize your data structure here.
"""
self.nums = []
def add(self, number):
"""
Add the number to an internal data structure..
:type number: int
:rtype: void
"""
if not self.nums or self.nums[-1] <= number:
self.nums.append(number)
return
l, r = 0, len(self.nums) - 1
mid = (l + r) / 2
while l < mid and mid < len(self.nums) - 1:
if self.nums[mid] < number and self.nums[mid + 1] >= number:
self.nums.insert(mid + 1, number)
return
elif self.nums[mid] >= number:
r = mid
mid = (l + r) / 2
else:
l = mid
mid = (l + r) / 2
if self.nums[mid] >= number:
self.nums.insert(mid, number)
else:
self.nums.insert(mid + 1, number)
def find(self, value):
"""
Find if there exists any pair of numbers which sum is equal to the value.
:type value: int
:rtype: bool
"""
l, r = 0, len(self.nums) - 1
while l < r:
if self.nums[l] + self.nums[r] < value:
l += 1
elif self.nums[l] + self.nums[r] > value:
r -= 1
else:
return True
return False
# Your TwoSum object will be instantiated and called as such:
# obj = TwoSum()
# obj.add(number)
# param_2 = obj.find(value)