leetcode 1. two sum



public class Solution {
    public int[] twoSum(int[] nums, int target) {
 for(int i = 0;i<nums.length;i++){
   for(int j = i+1;j<nums.length;j++){
    if(nums[i]+nums[j] == target){
     int[] a = {i,j};
     return a;
     
    }
   }
  }
  
  throw new IllegalArgumentException("No two sum solution");
    }
}