JAVA两数之和

遍历每个元素x，并查找是否存在一个值与target−x相等的目标元素。

class Solution {
     public static int[] twoSum(int[] nums, int target) {
            for(int i=0;i<nums.length;i++){
                int a = target - nums[i];
                for(int j=i+1;j<nums.length;j++){
                    if((i!=j) && (a==nums[j]) ){
                        return new int[] {i,j};
                    }
                }
            }
            throw new IllegalArgumentException("No two sum solution");
        }

        public static void main(String[] args){
            int[] nums = {2,3,7,10};
            int target = 9;
            int[] result = twoSum(nums,target);
            System.out.println("result:"+Arrays.toString(result));
        }

}