题目要求 解法一: 与two sum的思路相同,可以用二分法搜索。只是left + right的值等于target - sum. Time: O(n^2) Space: O(1) 代码: import java.util.*; class Program { public static List<Integer[]> threeNumberSum(int[] array, int targetSum