题解 | #两数之和#直接双循环解决问题

public class Solution {
    /**
     * 
     * @param numbers int整型一维数组 
     * @param target int整型 
     * @return int整型一维数组
     */
    public int[] twoSum (int[] numbers, int target) {
        // write code here
        //直接双循环解决问题
        int[] result = new int[2];
        for(int i = 0;i<numbers.length-1;i++){
            int n = numbers[i];
            for(int j =i+1;j<numbers.length;j++){
                if(n + numbers[j] == target){
                    result[0] = i + 1;
                    result[1] = j + 1;
                    return result;
                }
            }
        }
        return result;
    }
}