LeetCode | Two Sum

javascript 

 

function solution1(nums, target){
    console.log(nums, target);
    for(let i = 0; i<nums.length; i++){
        for(let j = i + 1; j<nums.length; j++){
            if( nums[i] + nums[j] === target){
                return [i, j];
            }
        }
    }
}
 
function solution2(nums, target){
    let dic = {};
    let result = [];
    for(let i = 0; i<nums.length; i++){
        let key = nums[i];
        dic[key] = i;
    }
 
    for(let i = 0; i<nums.length; i++){
        let key = target - nums[i];
        if(dic[key] !== undefined && dic[key] !== i){
            return [i, dic[key]];
        }
    }
}
 
//**** case1 ****
// let nums = [2,7,11,15];
// let target = 9;
 
//**** case2 ****
//let nums = [3,2,4];
//let target = 6;
 
//**** case3 ****
let nums = [2,5,5,11]
let target = 10;
 
// var result = solution1(nums, target);
// console.log(result);
 
var result = solution2(nums, target);
console.log(result);

 

 

c#

public class Solution {
    
    public int[] TwoSum(int[] nums, int target) {
        var dic = new Dictionary<int, int>();
            
            for(int i = 0; i<nums.Length; i++){
                var num = nums[i];
                if(dic.TryGetValue(target - num, out int index)){
                    return new []{index, i};
                }
                dic[num] = i;
            }
 
            return null;
    }
}

 

https://codereview.stackexchange.com/questions/189999/two-sum-leetcode

Two Sum Leetcode