Leetcode 1. Two Sum

題目:

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

題目大意:

求一個數組中的兩個元素的下標 , 這兩個元素相加和爲target

思路:

我用的最簡單的枚舉法 , 應該有更好的方法

class Solution {
    public static int[] twoSum(int[] nums, int target) {
        int[] i = new int[2];
        for(int x=0;x<nums.length;x++) {
            for(int j=x+1;j<nums.length;j++) {
                if(nums[x]+nums[j]==target) {
                    i[0] = x;
                    i[1] = j;
                    break;
                }
            }
        }
        return i;
    }
    public static void main(String[] args) {
        int[] i = twoSum(new int[] {2,7,11,15},9);
        for(int x:i)
            System.out.println(x);
    }
}