g0001_0100.s0001_two_sum.Solution.cs Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-all Show documentation

104 LeetCode algorithm problem solutions

There is a newer version: 1.8

namespace LeetCodeNet.G0001_0100.S0001_two_sum {

// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table
// #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Big_O_Time_O(n)_Space_O(n)
// #2023_12_18_Time_134_ms_(81.26%)_Space_44.8_MB_(19.72%)

public class Solution {
    public int[] TwoSum(int[] numbers, int target) {
        Dictionary indexMap = new Dictionary();
        for (int i = 0; i < numbers.Length; i++) {
            int requiredNum = target - numbers[i];
            if (indexMap.ContainsKey(requiredNum)) {
                return new int[] {indexMap[requiredNum], i};
            }
            indexMap[numbers[i]] = i;
        }
        return new int[] {-1, -1};
    }
}
}