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.
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

我的ac代码

import java.util.ArrayList;
import java.util.List;

public class Solution {
	public int[] twoSum(int[] nums, int target) {
        List<Integer> list=new ArrayList<>();
		
        for(int i=0;i<nums.length;i++) {
        	for(int j=i+1;j<nums.length;j++) {
        		if(nums[i]+nums[j]==target) {
        			list.add(i);
        			list.add(j);
        		}
        	}
		}
		Object[] objs = list.toArray();
		int[] ints=new int[objs.length];
		for (int i = 0; i < ints.length; i++) {
			ints[i]=(int) objs[i];
		}
		return ints;
    }
}