170. Two Sum III - 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.

For example,

add(1); add(3); add(5);
find(4) -> true
find(7) -> false

题目链接：

思路分析

设计一个TwoSum类，可以储存多个数字，并且判断储存的数字中是否有一对数字的和为要找的value。

使用了map，利用数字索引，可以提高查找效率。

class TwoSum {
public:
    /** Initialize your data structure here. */
    unordered_map<int,int> map;
    TwoSum() {

    }

    /** Add the number to an internal data structure.. */
    void add(int number) {
        map[number]++;
    }

    /** Find if there exists any pair of numbers which sum is equal to the value. */
    bool find(int value) {
        for(unordered_map<int,int>::iterator it = map.begin(); it != map.end(); it++){
            int i = it->first;
            int j = value - i;
            if((i == j && it->second > 1) || (i !=j && map.find(j) != map.end()))
                return true;
        }
        return false;
    }
};

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

时间复杂度：O(n)

反思

没有接触过的数据结构，要学习一个。