题目:
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
这是个加锁的easy题,怪不得之前没做过。这是一道和设计有关的题,要求设计一个TwoSum class,能够进行add和find操作,find返回boolean,但是题目没有明说要求的各个操作的时间复杂度。大概就按照2sum的两种思考方式来构造这个class,也就相当于换个方式考2sum所以也很简单,但这个设计还是很有讲究的,我刚开始就有好多没有仔细考虑的地方。
首先是第一种排序的方法。我刚开始想的是在add的时候就把它有序地排放,时间复杂度O(n),find就可以O(n)查找。但是我们需要考虑每一种操作的频率,比如add比find调用次数要多得多,那么就应该尽可能减少add的复杂度,所以要把排序放到find里,那么add就是O(1),find是O(nlogn)。另外为了避免每次find都要排序,我们可以再多定义一个field叫做sorted,用于表示这个list是否是有序的,如果是无序的才需要sort,而每次add完都要把sorted设为false因为它无序了。不得不说这些设计的小细节还真的蛮多的,有收获有收获。
Runtime: 68 ms, faster than 84.55% of Java online submissions for Two Sum III - Data structure design.
Memory Usage: 47.1 MB, less than 45.00% of Java online submissions for Two Sum III - Data structure design.
import java.util.Collections;
class TwoSum {
private List<Integer> nums;
private boolean sorted;
/** Initialize your data structure here. */
public TwoSum() {
nums = new ArrayList<>();
sorted = false;
}
/** Add the number to an internal data structure.. */
public void add(int number) {
nums.add(number);
sorted = false;
}
/** Find if there exists any pair of numbers which sum is equal to the value. */
public boolean find(int value) {
if (!sorted) {
Collections.sort(nums);
sorted = true;
}
int start = 0;
int end = nums.size() - 1;
int result[] = new int[2];
while (start < end) {
if (nums.get(start) + nums.get(end) == value) {
result[0] = start + 1;
result[1] = end + 1;
return true;
} else if (nums.get(start) + nums.get(end) > value) {
end--;
} else {
start++;
}
}
return false;
}
}
/**
* Your TwoSum object will be instantiated and called as such:
* TwoSum obj = new TwoSum();
* obj.add(number);
* boolean param_2 = obj.find(value);
*/
第二种方法是用原始2sum里面的hashmap法,对于数据结构的选择也还是有讲究的。在定义field的时候可以直接把存放这些数字的容器定义为hashmap,key是数字,value是数字对应的出现次数。为什么要存出现次数呢,为了防止两个一样的数字加起来为target的情况。其实如果count超过2了好像也没什么继续加下去的必要,毕竟每次只挑两个数相加,不过也无所谓了。这样的话add的时间复杂度是O(1),find是O(n),空间复杂度O(n)不变。但是咋运行起来这么慢呢。
Runtime: 102 ms, faster than 39.07% of Java online submissions for Two Sum III - Data structure design.
Memory Usage: 49.9 MB, less than 15.00% of Java online submissions for Two Sum III - Data structure design.
import java.util.Collections;
class TwoSum {
private Map<Integer, Integer> numToCount;
/** Initialize your data structure here. */
public TwoSum() {
numToCount = new HashMap<>();
}
/** Add the number to an internal data structure.. */
public void add(int number) {
if (numToCount.containsKey(number)) {
numToCount.put(number, numToCount.get(number) + 1);
} else {
numToCount.put(number, 1);
}
}
/** Find if there exists any pair of numbers which sum is equal to the value. */
public boolean find(int value) {
for (Map.Entry<Integer, Integer> entry : numToCount.entrySet()) {
int remain = value - entry.getKey();
if (numToCount.containsKey(remain)) {
// use this number only once
if (remain != value / 2) {
return true;
} else { // use this number twice
if (entry.getValue() > 1) {
return true;
}
}
}
}
return false;
}
}
/**
* Your TwoSum object will be instantiated and called as such:
* TwoSum obj = new TwoSum();
* obj.add(number);
* boolean param_2 = obj.find(value);
*/
哦对了这里还要补充一下笔记,java hashmap的遍历方法:
for循环写法:for (Map.Entry<K, V> entry : map.entrySet())
获取key/value:entry.getKey(), entry.getValue()