-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTwoSum.cs
More file actions
51 lines (49 loc) · 1.57 KB
/
Copy pathTwoSum.cs
File metadata and controls
51 lines (49 loc) · 1.57 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
namespace CodingProblems;
public partial class CodingProblems
{
/// <summary>
/// Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
/// You may assume that each input would have exactly one solution, and you may not use the same element twice.
///
/// You can return the answer in any order.
/// Example 1:
///
/// Input: nums = [2,7,11,15], target = 9
/// Output: [0,1]
/// Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
/// Example 2:
///
/// Input: nums = [3,2,4], target = 6
/// Output: [1,2]
/// Example 3:
///
/// Input: nums = [3,3], target = 6
/// Output: [0,1]
/// </summary>
/// <param name="nums"></param>
/// <param name="target"></param>
/// <param name="result"></param>
[Theory]
[InlineData(new []{2,7,11},9,new []{0,1})]
public void TwoSumProblem(int[] nums,int target,int[] result)
{
var res = TwoSum(nums, target);
res.Should().Contain(result);
}
private int[] TwoSum(int[] nums, int target)
{
var map = new Dictionary<int, int>();
for(var i = 0; i<nums.Length; i++){
var current = nums[i];
if (current == target) return new []{i};
var remain = target - current;
if (map.TryGetValue(remain, out var value)){
return new[] {
value, i
};
}
map.Add(current,i);
}
return Array.Empty<int>();
}
}