每日算法---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].

方案

namespace TwoSum
{
    public class Solution
    {
        public static int[] TwoSum(int[] nums, int target)
        {
            int[] result = new int[] { -1 }; // -1表示未找到
            for (int i = 0; i < nums.Length - 1; i++)
            {
                for (int j = 1; j < nums.Length; j++)
                {
                    if (nums[i] + nums[j] == target)
                        result = new int[] { i, j };
                }
            }

            return result;
        }
    }
}

算法仓库

https://github.com/myjackbase/Ming.Algorithm