leetCode 1. Two Sum in java

leetCode 1. Two Sum in java

class Solution {
    public int[] twoSum(int[] nums, int target) {
        int first = nums[0];
        for (int i=0; i<nums.length-1; i++){
            for (int j=i+1; j<nums.length; j++){
                if(nums[i]+nums[j] == target){
                    return new int[]{i,j};
                }
            }
        }
        return new int[2];
    }
}