【LeetCode】(C#)1. Two Sum(Easy)

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.

public int[] TwoSum(int[] nums, int target) {
int[] result=new int[2];
for(int i=0;i<nums.Length;i++)
{
for(int j=0;j<nums.Length;j++)
{
if(i!=j)
{
if(nums[i]+nums[j]==target)
return new int [] {i,j};
}
}
}
return result;
}