Leetcode1

https://leetcode.cn/problems/two-sum/description/

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