题解 | #两数之和#

public class Solution {
    /**
     * 
     * @param numbers int整型一维数组 
     * @param target int整型 
     * @return int整型一维数组
     */
    public int[] twoSum (int[] numbers, int target) {
        // write code here
        int[] returnArray = new int[2];
        
        int term = 0;
        for(int i = 0; i < numbers.length; i++){

            for(int j = i+1; j < numbers.length; j++){
                if(numbers[i] + numbers[j] == target){
                    returnArray[0] = i+1;
                    returnArray[1] = j+1;
                    term = 1;
                    break;
                }
            }
            if(term == 1){
                break;
            }
        }
        
        return returnArray;
    }
    
    
}