g0001_0100.s0001_two_sum.Solution.dart 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

// #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)
// #AI_can_be_used_to_solve_the_task #2024_09_28_Time_305_ms_(99.57%)_Space_146.2_MB_(99.70%)

class Solution {
  List twoSum(List numbers, int target) {
    Map indexMap = {};
    for (int i = 0; i < numbers.length; i++) {
      int requiredNum = target - numbers[i];
      if (indexMap.containsKey(requiredNum)) {
        return [indexMap[requiredNum]!, i];
      }
      indexMap[numbers[i]] = i;
    }
    return [-1, -1];
  }
}