two sum --无脑法

public class Solution {
    /*
     * @param numbers: An array of Integer
     * @param target: target = numbers[index1] + numbers[index2]
     * @return: [index1 + 1, index2 + 1] (index1 < index2)
     */
    public int[] twoSum(int[] numbers, int target) {
        // write your code here
        int res[] = new int[2];
        for(int i = 0; i<numbers.length;i++){
            for( int j = i+1; j < numbers.length;j++){
                if(numbers[i] + numbers[j] == target){
                    res[0] = i+1;
                    res[1] = j+1;
                }
            }
        }
        return res;
    }
}