Two Sum

Given an array of integers, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

Run Status: Compile Error

Line 8: cannot find symbol: method size()

Run Status: Compile Error

Line 16: unreported exception java.lang.Exception; must be caught or declared to be thrown

Run Status: Wrong Answer

Progress: 0/10 test cases passed.

Showing the first failed test case.
input
output
expected
 
[5,75,25],
 100
1, 2
2, 3
  

Run Status: Accepted!
Program Runtime: 488 milli secs

Progress: 10/10 test cases passed.

Run Status: Accepted!
Program Runtime: 540 milli secs

Progress: 10/10 test cases passed.

public class Solution {
    public int[] twoSum(int[] numbers, int target) {
        // Start typing your Java solution below
        // DO NOT write main() function
        int position = 0;
        for (int first : numbers) {
            int temp = target - first;
            for (int j = position+1; j < numbers.length; j++) {
                if (numbers[j] == temp) {
                    int[] result = new int[] {position+1, j+1};
                    return result;
                }
            }
            position++;
        }
        return new int[]{-1,-1};
        
    }
}