Two Sum - Data structure design

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.

java

public class TwoSum {
    /*
     * Add the number to an internal data structure.
     * @param number: An integer
     * @return: nothing
     */
    Map<Integer, Integer> map = null;
    List<Integer> list = null;
    public TwoSum() {
        map = new HashMap<>();
        list = new ArrayList<>();
    }
    public void add(int number) {
        // write your code here
        if (map.containsKey(number)) {
            map.put(number, map.get(number) + 1);
        } else {
            map.put(number, 1);
            list.add(number);
        }
    }
    /*
     * @param value: An integer
     * @return: Find if there exists any pair of numbers which sum is equal to the value.
     */
    public boolean find(int value) {
        // write your code here
        for (int i = 0; i < list.size(); i++) {
            int num = list.get(i);
            int target = value - num;
            if (num == target && map.get(num) > 1) {
                return true;
            } else if (num != target && map.containsKey(target)) {
                return true;
            } else {
                continue;
            }
        }
        return false;
    }
}


// Your TwoSum object will be instantiated and called as such:
// TwoSum twoSum = new TwoSum();
// twoSum.add(number);
// twoSum.find(value);

python

class TwoSum:
    """
    Add the number to an internal data structure.
    @param: number: An integer
    @return: nothing
    """
    def __init__(self):
        self.mapping = {}
    
    def add(self, number):
        # write your code here
        if number in self.mapping:
            self.mapping[number] += 1
        else:
            self.mapping[number] = 1

    """
    @param: value: An integer
    @return: Find if there exists any pair of numbers which sum is equal to the value.
    """
    def find(self, value):
        # write your code here
        for ele in self.mapping:
            target = value - ele
            if target == ele and self.mapping[ele] > 1:
                return True
            elif target != ele and target in self.mapping:
                return True
            else:
                continue
        return False


# Your TwoSum object will be instantiated and called as such:
# twoSum = TwoSum()
# twoSum.add(number)
# twoSum.find(value)



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

ncst

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值