-
-
Notifications
You must be signed in to change notification settings - Fork 1
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Added a run for the two-sum problem with reduced time complexity.
- Loading branch information
1 parent
2472bc0
commit 9dc6728
Showing
2 changed files
with
42 additions
and
2 deletions.
There are no files selected for viewing
39 changes: 39 additions & 0 deletions
39
samples/Hussy.Net.Playground/Leetcode/Easy/TwoSum/ComplexityRun.cs
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,39 @@ | ||
using Glitter.Collections; | ||
|
||
namespace Hussy.Net.Playground.Leetcode.Easy; | ||
|
||
/// <summary> | ||
/// Represents a solution and its tests for the leetcode two-sum problem. | ||
/// </summary> | ||
/// <see href="https://leetcode.com/problems/two-sum/description/"/> | ||
public sealed partial class TwoSum | ||
{ | ||
/// <summary> | ||
/// A direct approach to solving the problem with less time complexity | ||
/// to understand where Hussy may be lacking. | ||
/// </summary> | ||
/// <param name="numbers">The array of numbers to look through.</param> | ||
/// <param name="target"> | ||
/// The target number which the two numbers in <paramref name="numbers"/> must add up to. | ||
/// </param> | ||
/// <returns> | ||
/// The two indices of the numbers which add up to the <paramref name="target"/>. | ||
/// </returns> | ||
private static IEnumerable<int> ComplexityRun( | ||
int[] numbers, | ||
int target) | ||
{ | ||
var seen = new Dictionary<int, int>(); | ||
for (var i = 0; i < numbers.Length; i++) | ||
{ | ||
var currentNumber = numbers[i]; | ||
var complement = target - currentNumber; | ||
if (seen.TryGetValue(complement, out var value)) | ||
return [value, i]; | ||
|
||
seen[currentNumber] = i; | ||
} | ||
|
||
return Enumerable.Empty<int>(); | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters