LeetCode 1. Two Sum

C++
vector<int> twoSum(vector<int>& nums, int target)
    {
        for (int i = 0; i < nums.size() - 1; i++)
		    for (int j = i+1; j < nums.size() ; j++)
			    if (nums[i] + nums[j] == target)
                    return {i,j};
    }

Java
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[j]==(target-nums[i]))
             {
                 return new int [] {i,j};
             }
         }
     }
      throw new RuntimeException("No two sum solution");
    }
}