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].

 public int[] twoSum(int[] nums, int target) {
        List list = new ArrayList();
        for (int i = 0; i<nums.length; i++){
            list.add(nums[i]);
        }
        int res1 = 0;
        int res2 = 0;
        for(int i = 0; i <list.size(); i++){
            int x = target - nums[i];
            if(list.contains(x)){
                if(i != list.indexOf(x)){
                    res1 = i;
                    res2 = list.indexOf(x);
                    break;
                }
            }
        }
        return new int[] {res1 , res2};
    }