https://leetcode.com/problems/two-sum/ Example: Given nums = [2, 7, 11, 15], target = 9, Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1]. Java: 版本1,暴力搜索(减少了部分搜索),预计打败全世界30%的答案. public int[] twoSum(int[] nums, int target) { int size = nums.length…