Given nums = [2, 7, 11, 15], target = 9, Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].
public int[] twoSum(int[] nums, int target) { int [] result=new int[2]; for(int i=0;i<nums.length;i++) for(int j=i+1;j<nums.length;j++) if(nums[i]+nums[j]==target) { result[0]=i; result[1]=j; return result; } throw new IllegalArgumentException("no two sum solution"); }
