Last weekend I was asked this question in an interview. There is an array of positive numbers. From this array , you need to find out the subset. From this subset, you should be able to pick up any two numbers and their sum would always be greater than k. k is an user inputted value. Last weekend I was asked this question in an in
阅读背景：
如何找出任何两个元素总和> k的子数组？
来源：互联网
分享到：
