LeetCode|Two Sum-优快云博客

本文介绍了一个经典的算法问题“两数之和”的C#解决方案。该问题要求从整数数组中找到两个数，使它们相加等于特定的目标值，并返回这两个数的下标。文章提供了使用C#字典实现的示例代码，但当前算法的时间复杂度较高，导致运行超时。

Questioin Description:

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].

----------------------------------------Dividing line-----------------------------------------------------------------------------

Here is my anwer.The programming language is C#.The run code status is finished,howerer ,the Submission result is "Time Limit Exceeded".
Obviously,the algorithm complexity does not meet the requirements.

public class Solution {
    public int[] TwoSum(int[] nums, int target) {
        Dictionary<int,int> dic=new Dictionary<int,int>();
        for(int i=0;i<nums.Length;i++){
            dic.Add(i,nums[i]);
        }
        for(int i=0;i<nums.Length;i++)
        {
            int complement=target-nums[i];
            if(dic.ContainsValue(complement))
            {
                    var keys= dic.Where(m => m.Value == complement).Select(q => q.Key);
                    foreach (var item in keys)
                    {
                        if(item==i)
                        {
                            continue;
                        }
                        return new int[] { i, item };
                    }
            }
        }
        throw new Exception("there is no answer");
    }
}

 Welcome to discuss technical issues with me.

转载于:https://www.cnblogs.com/dayang12525/p/7124840.html