Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- 求问FB题目 - 未名空间(mitbbs.com)
- http://www.mitbbs.com/article_t/JobHunting/32872629.html
- 2, 给一个int array,有正有负, 给一个target number,找出这个array里有没有连
- 续的几个数之和等于target number 要用O(n) time
- 感觉是DP,但是没什么头绪。
- 2. 将(0,i)的和存在hashmap<int, vector<int> >,key为(0,i)的和,vector<int>记
- 录具有相同和的下标。然后从头开始,对于i,如果(0,i)的和为sum, 找sum-x是否在
- hashmap中,如果在且vector中有小于i的下标,存在,否则i++;
- me: 4-sum also
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement