1.Two Sum

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.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

public class Solution {
    public int[] TwoSum(int[] nums, int target) 
    {
        int[] result = {0,0};
        for (int i = 0; i < nums.Length - 1; i++)
        {
            for (int j = 1; j < nums.Length - i; j++)
            {
                if (nums[i] + nums[j + i] == target)
                {
                    result[0] = i;
                    result[1] = j + i;
                    break;
                }
            }
        }
        return result;
    }
}